Knowledge Graph
Navigate concepts visually
Click any node to re-center the graph around it. Solid nodes are mapped topics — dashed nodes are on the way.
Requires
Related
Next topics
Dynamic Programming
Recursion
Big-O Notation
Longest Common Subsequence
Edit Distance
Greedy Algorithms
Graph Traversal (BFS & DFS)
Requires
Focus
Dynamic Programming
Related
Next topics
A
Dynamic Programming turns the exponential blowup of naive recursion into a polynomial-time algorithm by caching every subproblem's answer exactly once — Fibonacci, Coin Change, and Grid Paths are the entry points before knapsack-style problems add a second dimension.
Open topic →