dp_algorithms/burst_balloons library
🎈 Burst Balloons (DP)
Given an array of balloon values, each time you burst a balloon i you
earn numsleft * numsi * numsright (where left/right are adjacent
remaining balloons). Find the maximum coins you can collect.
Contract:
- Input: List
- Output: int maximum coins.
Time Complexity: O(n^3) Space Complexity: O(n^2)
Example:
final nums = [3,1,5,8];
expect(maxCoins(nums), equals(167));