Interval DP Problems
Less than 1 minute
Interval DP Problems
| Problem Number | Title | Solution | Tags | Difficulty |
|---|---|---|---|---|
| 0486 | Predict the Winner | [[LeetCode XXXX]] | Recursion, Array, Math, Dynamic Programming, Game Theory | Medium |
| 0312 | Burst Balloons | [[LeetCode XXXX]] | Array, Dynamic Programming | Hard |
| 0877 | Stone Game | [[LeetCode XXXX]] | Array, Math, Dynamic Programming, Game Theory | Medium |
| 1000 | Minimum Cost to Merge Stones | [[LeetCode XXXX]] | Array, Dynamic Programming, Prefix Sum | Hard |
| 1547 | Minimum Cost to Cut a Stick | [[LeetCode XXXX]] | Array, Dynamic Programming, Sorting | Hard |
| 0664 | Strange Printer | [[LeetCode XXXX]] | String, Dynamic Programming | Hard |
| 1039 | Minimum Score Triangulation of Polygon | [[LeetCode XXXX]] | Array, Dynamic Programming | Medium |
| 0546 | Remove Boxes | [[LeetCode XXXX]] | Memoization, Array, Dynamic Programming | Hard |
| 0375 | Guess Number Higher or Lower II | [[LeetCode XXXX]] | Math, Dynamic Programming, Game Theory | Medium |
| 0678 | Valid Parenthesis String | [[LeetCode XXXX]] | Stack, Greedy, String, Dynamic Programming | Medium |
| 0005 | Longest Palindromic Substring | [[LeetCode XXXX]] | String, Dynamic Programming | Medium |
| 0516 | Longest Palindromic Subsequence | [[LeetCode XXXX]] | String, Dynamic Programming | Medium |
| 0730 | Count Different Palindromic Subsequences | String, Dynamic Programming | Hard | |
| 2104 | Sum of Subarray Ranges | Stack, Array, Monotonic Stack | Medium |