Data Structures & Algorithms
Complexity, arrays, lists, trees, heaps, hashing, graphs, dynamic programming, range queries and string algorithms — 65 modules, 102 compiled and sanitizer-checked programs, a 45-pattern library and interview prep.
Lessons
- Graph Fundamentals
- BFS and DFS
- Topological Sorting and DAG Algorithms
- Shortest Paths
- Minimum Spanning Trees
- Cycle Detection and Connectivity
- Advanced Graph Algorithms
- Grid and State-Space Graphs
- Fenwick Tree (Binary Indexed Tree)
- Segment Trees
- Sparse Tables and RMQ
- Mo's Algorithm and Offline Queries
- Square Root Decomposition
- Persistent and Functional Data Structures
- Advanced Trees and Specialized Structures
- Prefix Function, KMP, and Z Algorithm
- Rolling Hash and Rabin–Karp
- Suffix Arrays, LCP, and Suffix Structures
- Manacher and Palindromic Structures
- Advanced Sequence Algorithms
- Introduction to DSA
- Complexity Analysis
- Mathematics for DSA
- C++ Toolkit for DSA
- Arrays and Dynamic Arrays
- Strings
- Linked Lists
- Stacks
- Queues, Deques, and Circular Buffers
- Hashing and Hash Tables
- Number Theory
- Combinatorics and Counting
- Geometry for DSA
- Probability and Randomized Algorithms
- Advanced Greedy and Exchange Proofs
- Advanced Dynamic Programming
- Branch and Bound and Exact Search
- Randomized, Approximation, and Online Algorithms
- Parallel and Cache-Aware Algorithms
- Reading and Modeling a Problem
- Constraint-Driven Algorithm Selection
- Correctness and Proof Writing
- Debugging and Test Design
- C++ Implementation Safety
- Interview DSA Roadmap
- Problem Bank and Progression
- Problem-Solving Pattern Library
- Assessment and Capstone Projects
- Reference Tables, Teaching Sequence and Glossary
- Trees: Fundamentals
- Binary Search Trees
- Balanced Search Trees
- Heaps and Priority Queues
- Tries and Prefix Trees
- Disjoint Set Union (Union-Find)
- Searching
- Sorting
- Recursion and Backtracking
- Divide and Conquer
- Greedy Algorithms
- Dynamic Programming (DP)
- Two Pointers
- Sliding Window
- Prefix Sums, Difference Arrays, and Range Queries
- Monotonic Stack and Monotonic Queue
- Bit Manipulation and Bitmasking
- Course Overview