C++ Mastery Hub

Pinned · Quick Review

🔖

Pinned · Quick Review

My Bookmarks · saved chapters & topics

Granular chapter bookmarks from any module.

0▶

📝

Study Engine · Review

My Notes · your scratchpad content

Quick notes saved globally across all modules.

0▶

Track 1 · 4 Modules

◆

Track 1 · 4 Modules

Core Engineering · The Foundations of Mastery

C++ syntax, OOP, templates, modern C++17, and concurrency.

▶

Foundations — From Zero to Confident

Ch 1–9 · Setup, Variables, Control Flow, Pointers, Memory

Core↗ 02

OOP Mastery — Classes, Inheritance & Polymorphism

Ch 1–10 · Classes, SOLID, Rule of Five, Virtual Dispatch

Core↗ 03

Advanced C++ — Templates, STL & Modern C++

Ch 1–10 · Templates, Smart Pointers, Lambdas, Concurrency

Core↗ 04

Pure Mastery — What Senior Engineers Know

Ch 1–10 · UB, Memory Model, TMP, Performance, ABI

Core↗

Track 2 · 2 Modules

⬡

Track 2 · 2 Modules

DSA & Logic · Algorithms & Reasoning

Trees, graphs, DP, sorting, complexity, and systematic problem thinking.

▶

DSA with C++ — Every Structure, Every Algorithm

Ch 1–15 · Arrays, Trees, Graphs, DP, Greedy, Tries

DSA↗ 07

The Logic Builder — How to Think Before You Code

Ch 1–12 · Problem Framework, Number Logic, Recursion

Logic↗

Track 3 · 5 Modules · 14 Problem Chapters

⚔️

Track 3 · 5 Modules · 14 Problem Chapters

The Arena · Applied Problem Solving

Capstone challenges, 150+ structured problems from arrays to bitwise sorcery.

▶

The Black Box — ICPC & Codeforces Edition

Ch 16–27 · Contest Templates, Number Theory, Network Flow

CP↗ 08

Problem Solving Pt.1 — Basic Math, Decisions, Loops

P01–P28 · Ch 1–3

Practice↗ 09

Problem Solving Pt.2 — Arrays, Strings, Patterns

P29–P61 · Two Pointer, Sliding Window

Practice↗ 10

Problem Solving Pt.3 — Matrix, Intermediate, OOP

P62–P92 · Matrix Traversal, Binary Search

Practice↗ 11

Problem Solving Pt.4 — Complex Patterns & Contest Math

P93–P132 · Spiral Matrix, Number Theory

Practice↗

Track 4 · 6 Parts · 210 Problems

🎯

Track 4 · 6 Parts · 210 Problems

Interview Prep · The Problem Setbook

LeetCode, Codeforces, HackerRank decoded. Arrays to Greedy — every problem fully solved.

▶

Part 1 — Arrays, Strings, Two Pointers, Sliding Window

Q001–Q035 · Hashing · Prefix Sum

Interview↗ P2

Part 2 — Stacks, Queues, Linked Lists, Hashing

Q036–Q070 · Monotonic Stack · Deque

Interview↗ P3

Part 3 — Trees, BST, Heaps & Priority Queues

Q071–Q105 · Tree DP · Heap patterns

Interview↗ P4

Part 4 — Graphs: BFS/DFS, Topo Sort, DSU, Dijkstra

Q106–Q140 · Union-Find · Bellman-Ford

Interview↗ P5

Part 5 — Dynamic Programming — 1D, 2D, Knapsack, String

Q141–Q175 · DP on Trees · Full approach comparison

Interview↗ P6

Part 6 — Greedy, Backtracking, Bit Manipulation

Q176–Q210 · Final challenge set · Advanced patterns

Interview↗

C++ MasterySeries