Solution: Burst Balloons

Explore how to apply interval dynamic programming to maximize coins from bursting balloons in optimal order. Understand the use of memoization with a 2D DP table to solve overlapping subproblems efficiently in this classic dynamic programming challenge.