DSA & Competitive Programming — Interactive Roadmap
Click any cluster title to open its curated LeetCode / theory page.
Green = solid • Orange = needs polish • Red = priority focus
Foundations
Complexity, Math, Bits, Sieve
Arrays & Prefix
Prefix sum, Kadane, diff array
Hashing & Maps
Freq maps, double-hash
Strings & Pattern Matching
KMP, Z, Rabin-Karp, Tries
Special CP Techniques
Binary search on answer,
offline queries
Randomized, Meet-in-the-middle
Stacks & Queues
Monotonic stack/queue
Recursion & Backtracking
DFS, permutations, subsets
Trees
Traversal, LCA, Tree DP
Graphs
BFS/DFS, Dijkstra, SCC, Flow
Dynamic Programming
1D/2D/Tree/Bitmask DP
Advanced Data Structures
SegTree, Fenwick, HLD, Mo's
Tries & String DS
Trie, Aho-Corasick, suffix tools
Geometry
Convex hull, line intersection