Skip to content
Tagged articles

Pivot

7 articles · Page 1 of 1
Linux Tech Enthusiast
Linux Tech Enthusiast
Oct 25, 2026 · Databases

10 Advanced SQL Techniques for Data Science Interviews

This article covers 10 advanced SQL concepts — CTEs, recursive CTEs, temporary functions, CASE WHEN pivoting, EXCEPT vs NOT IN, self-joins, ranking functions, delta calculations, running totals, and datetime manipulation — with practical code examples for data science interviews.

CTEData Science InterviewsDateTime Manipulation
0 likes · 11 min read
10 Advanced SQL Techniques for Data Science Interviews
Data STUDIO
Data STUDIO
Nov 12, 2025 · Databases

7 Reusable DuckDB SQL Patterns for Fast Local Data Analysis

This article presents seven practical DuckDB SQL patterns—querying files directly, treating partition folders as tables, deduplicating with QUALIFY, computing rolling metrics with window functions, pivot/unpivot, handling JSON arrays, and exporting results to Parquet—plus tips and a mini case study that show how to turn a notebook into a lightweight OLAP engine without leaving the Python environment.

DuckDBJSONParquet
0 likes · 12 min read
7 Reusable DuckDB SQL Patterns for Fast Local Data Analysis
Tinker Programmer
Tinker Programmer
Nov 4, 2018 · Fundamentals

Understanding Quick Sort: A Divide-and-Conquer Improvement Over Bubble Sort

Quick sort improves on bubble sort by using a divide‑and‑conquer partitioning strategy, selecting a pivot to recursively sort sub‑arrays, achieving an average time complexity of O(n log n) and a worst case of O(n²), with a vivid “hole‑filling” analogy to illustrate the process.

Algorithm ComplexityDivide and ConquerPivot
0 likes · 4 min read
Understanding Quick Sort: A Divide-and-Conquer Improvement Over Bubble Sort