DSA Pattern Guide
Dynamic Programming Patterns Guide
Dynamic programming interview problems almost always reduce to recognizing one of a handful of shapes: 0/1 knapsack (include-or-exclude decisions with a capacity constraint), longest-increasing-subsequence style sequence problems, interval/partition DP, and DP on subsets or bitmasks. Once you identify the shape, defining the state and transition is usually the only real work left.
16
Problems in Ediky's DSA bank
15
Questions in Ediky's DSA-Technical bank
Largest single topic in the code-judged bank
Rank among DSA topics
The patterns that matter
- 0/1 knapsack — include-or-exclude decisions under a capacity constraint
- Longest increasing subsequence (LIS) and its variants
- Interval / partition DP — splitting a sequence or range optimally
- DP on subsets / bitmask DP — when the state needs to track "which items so far"
Real problems from Ediky's DSA bank
Actual problem titles:
- "Baby Ninja" (Dynamic Programming)
- "Count Ways to Build Binary Strings" (Dynamic Programming)
- "Maximum Value of a Four-Part Signed Partition" (Dynamic Programming)
- "Losing Chess Strategy" (Dynamic Programming)
Practice Dynamic Programming problems
16 code-judged DP problems — Ediky's largest single DSA topic, plus 15 more in DSA-Technical.
Open DP problems