LeetCode 877: Stone Game
A clear explanation of the Stone Game problem using game theory and interval dynamic programming.
Tag
Interval-Dp
8 notes
LeetCode 1000: Minimum Cost to Merge Stones
A clear explanation of merging consecutive stone piles with minimum cost using interval dynamic programming.
LeetCode 664: Strange Printer
A clear explanation of minimizing printer turns using interval dynamic programming.
LeetCode 546: Remove Boxes
A clear explanation of maximizing remove-box scores using interval dynamic programming with memoization.
LeetCode 516: Longest Palindromic Subsequence
A clear explanation of finding the length of the longest palindromic subsequence using interval dynamic programming.
LeetCode 471: Encode String with Shortest Length
A clear explanation of interval dynamic programming for encoding a string into the shortest k[encoded_string] form.
LeetCode 375: Guess Number Higher or Lower II
A clear explanation of finding the minimum guaranteed cost using interval dynamic programming.
LeetCode 312: Burst Balloons
A clear explanation of Burst Balloons using interval dynamic programming and the last-burst idea.