Knapsack merging without fear
A clean mental model for tree DP, budget states, and merging child subproblems without memorizing templates.
Data Structures and Algorithms
The patterns, structures, and strategies behind efficient computation.
Dynamic ProgrammingGraphsTreesComplexity
Binary lifting finally visualized
Jump tables, kth ancestors, and LCA explained with the intuition first and the template second.
No articles match this search.