Burst Balloons
Hard
Dynamic Programming
Interval DP
Burst balloons to maximize coins collected.
Input: space-separated values
Output: max coins
Constraints
See problem-specific constraints. Optimized solution required.
Examples
Example 1:
Input: 3 1 5 8
Output:
Example 2:
Input: 3 1 5 8
Output:
Hints
Consider a interval dp approach.
Think about time complexity.
Tests:
Runtime:
Memory:
Test
Input:
Expected:
Got:
Click Run Code to test against sample cases, or Submit to test against all cases.
▲ Console