Solution: Burst Balloons

Explore the dynamic programming method to solve the burst balloons problem by breaking it into subproblems. Understand how to use interval DP to find the maximum coins collected by choosing the optimal burst order, and learn to implement and analyze this O(n³) time complexity solution in C++.