Coding Trainer
Burst Balloons
Problem
Burst all balloons to maximize coins. Bursting balloon i gives nums[i-1]*nums[i]*nums[i+1] coins. Out-of-bounds treated as 1.
Example: nums=[3,1,5,8] → 167