Burst balloons
You have balloons in a row; nums[i] holds a coin value. Bursting balloon i earns nums[left]*nums[i]*nums[right] coins where left and right are the adjacent still-unburst balloons (treat out-of-range as 1). Burst all balloons to maximize total coins. Return the maximum. 1 <= len(nums) <= 300, 0 <= nums[i] <= 100.
Implement
max_burst_coins(nums: list[int]) → intExamples
in
[[3,1,5,8]]out167What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 40 min
solution.py
InputExpectedGot
[[3,1,5,8]]167not run yetsample