prdlk / leetcode · dependency spine

How the 24 topics build on each other

LeetCode topic dependency spine Dependency graph of 24 LeetCode study topics across five phases, showing which topics build on which, with Tree DFS and 1-D dynamic programming as the two central hubs. PHASE I — LINEAR STRUCTURES PHASE III — HIERARCHICAL PHASE II — NODAL & GRID PHASES IV–V — RELATIONAL & DECISION-SPACE 05 Binary Search 03 Two Pointers 04 Sliding Window 06 Stack 07 Monotonic Stack 01 Hash Lookup 02 Prefix Sum 11 Tree DFS 13 Binary Search Tree 14 Heap priority queue 15 Trie 12 Tree BFS 08 Linked List 09 Hybrid Structures 10 Matrix Index Math 16 Graph DFS 18 Topological Sort 19 Union-Find 20 Backtracking 21 1-D DP dynamic programming 22 Multi-D / Grid DP 17 Graph BFS 23 Greedy 24 Intervals LEGEND ENTRY — NO PREREQS TOPIC FOCAL HUB BUILDS ON PHASE ZONE