PROBLEMS/ADVANCED DP
Advanced DP LeetCode Problems
63 hand-tagged Advanced DP problems across 2 interview patterns (Bitmask DP, Interval DP), ranked by importance (how often each pattern shows up in real coding interviews). Work top-down within each pattern.
| # | PROBLEM | DIFF | ELO | IMP | PATTERNS |
|---|---|---|---|---|---|
| 1 | Minimum XOR Sum of Two Arrays | Hard | 2145 | 72 | General Bit Manipulation |
| 2 | Special Permutations | Hard | 2021 | 62 | |
| 3 | Smallest Sufficient Team | Hard | 2251 | 62 | General Bit Manipulation |
| 4 | Maximum Profit from Valid Topological Order in DAG | Hard | 2353 | 62 | Topological Sort · General Greedy (Greedy is main insight) |
| 5 | Beautiful Arrangement | Medium | 1576 | 58 | Permutations · General Bit Manipulation |
| # | PROBLEM | DIFF | ELO | IMP | PATTERNS |
|---|---|---|---|---|---|
| 1 | Burst Balloons | Hard | 2073 | 82 | |
| 2 | Minimum Cost to Cut a Stick | Hard | 2116 | 72 | Sorting + Comparison |
| 3 | Strange Printer | Hard | 2098 | 62 | Word Break / String DP |
| 4 | Minimum Score Triangulation of Polygon | Hard | 2130 | 58 | |
| 5 | Minimum Cost to Merge Stones | Hard | 2423 | 56 | Prefix Sums |
EVERY PATTERN
// your mastery
What's your Advanced DP tier?
leaps.gg syncs your LeetCode history and scores your mastery of every pattern, then recommends the exact problems to do next with spaced repetition. Free to start.
GET MY MASTERY MAP →