Skip to content
DP
✅ Step 1: Start with Classical Easy/Medium DP Problems (Foundations)
Focus: 1D/2D DP, subproblems, transitions — build your fundamentals here.
Start here even if you know recursion — this builds confidence.
✅ Step 2: Grid-Based DP Problems
Focus: Tabulation in 2D arrays, down-right transitions, obstacle handling.
✅ Step 3: String DP (Subsequences & Substrings)
Focus: LCS, edit distance, palindromes — classic interview DP.
✅ Step 4: DP on Choices
& Decision Making (Knapsack-like)
Focus: Choosing items, maximizing/minimizing values — classic DP pattern.
✅ Step 5: Stock Buy and Sell Problems
Focus: State transitions with multiple variables (buy/sell states, cooldown, fees, transactions).
✅ Step 6: DP on Subsequences and LIS Problems
Focus: Longest increasing subsequence and variants — involves binary search and DP hybrid.
✅ Step 7: Advanced Variants - Interval DP
Focus: DP with ranges, often requires 3 nested loops and precomputed costs.
✅ Step 8: DP on Trees and Graphs
Focus: Tree DP, Subtree-based recursion, Graphs + DP hybrid.
✅ Step 9: Digit DP (Rare but Advanced)
Focus: Recursion + memoization on digits (base-10 positional logic).
✅ Step 10: Bitmask DP (Hard / Advanced)
Focus: Subset problems, permutations — common in contests.
Want to print your doc?
This is not the way.
This is not the way.
Try clicking the ⋯ next to your doc name or using a keyboard shortcut (
CtrlP
) instead.