C++ & SQL Mastery Library — 1084 Solved Problems

1000 problems. Eight volumes. One complete journey from your very first line of C++ to the frontiers of modern algorithms.

This is the complete collection: 1000 carefully designed C++ problems, organized into 8 progressive volumes that take you from absolute beginner to advanced algorithmic mastery — with every single solution compiled and tested on g++.

What you get:

- 1000 problems, carefully ordered by difficulty across 8 volumes

- A complete, working C++ solution for every problem

- Clear explanations, hints, and complexity analysis throughout

- A structured path, so you never have to guess what to learn next

Every problem includes:

- A clear statement with examples and constraints

- A hint to point you in the right direction

- A full, tested C++ solution

- Time and space complexity

- A plain-language explanation of how it works

The 8 volumes:

1. Absolute Beginner — I/O, Variables, Conditions, Loops, Functions, Arrays

2. Beginner — Strings, Recursion, Basic Math, Simple Data Structures

3. Elementary — Sorting, Searching, Core Algorithms, the STL

4. Upper-Intermediate — Data Structures, Two Pointers, Prefix Sums, Greedy

5. Advanced — Graphs, Dynamic Programming, Trees, Shortest Paths

6. Expert — Advanced Strings, Heavy Graph Machinery, Computational Geometry

7. Master — Suffix Structures, Flow & Matching, Number Theory, Combinatorics

8. Genius — Polynomials & Transforms, Advanced Graphs, Capstone Challenges

Who it's for:

Anyone learning C++ who wants a structured, guided path — students, self-taught programmers, and anyone preparing for coding interviews or competitive programming who wants every step explained, not just a list of problems.

One thousand problems. Eight volumes. A complete roadmap from foundations to mastery.

Stop reading SQL theory. Start solving.

This book is 84 hand-picked SQL problems that take you from your first SELECT statement to genius-level analytical queries — the kind that show up in real technical interviews.

No theory chapters. No filler. Every single problem gives you a clear prompt, a sample input table, the exact expected output, a working solution, and a plain-English explanation of why it works — not just what to type.

The seven volumes rise one honest step at a time: Beginner → Easy-Medium → Medium → Medium-Hard → Hard → Expert → Genius. Volume 1 is single-table filtering and sorting. By Volume 7 you're computing medians without window functions, counting concurrent events, and finding the smallest missing positive integer — pure interview-grade challenges.

Every query in this book was tested against a real database before publishing. No broken code, no queries that only work in theory.

Who this is for

You already know the basics of SQL and want to get genuinely good at it. Whether you're preparing for a data or backend interview, leveling up from simple queries to window functions and CTEs, or just want deliberate practice instead of passive reading — this is your workbook.

How to use it

Solve each problem yourself first. Open any free SQL playground, recreate the table, and write your own query before reading the solution. The reading comes second; the typing comes first.

Note: examples use standard SQL. A few advanced solutions (window functions, PERCENTILE_CONT, recursive CTEs) target PostgreSQL-style engines; equivalents are explained where they differ.

146 pages · 7 volumes · 84 problems · one complete path from beginner to expert.

What's inside (you can add this as a bulleted section)

Volume 1 — Beginner: single-table filtering, sorting, basic conditions

Volume 2 — Easy-Medium: aggregation, GROUP BY, HAVING, CASE, NULL handling

Volume 3 — Medium: INNER/LEFT joins, subqueries, the classic NULL traps

Volume 4 — Medium-Hard: multi-table joins and CTEs

Volume 5 — Hard: window functions (ROW_NUMBER, RANK, running totals, medians)

Volume 6 — Expert: interview-grade problems — pivots, recursive CTEs, graph traversal, sargability

Volume 7 — Genius: everything at once — gaps-and-islands, concurrent events, hierarchies, the hardest patterns