Given n balloons with values, burst them one at a time. Bursting balloon i gives nums[i-1]*nums[i]*nums[i+1] coins. Maximize total coins.
Input: nums=[3,1,5,8] Output: 167 (burst order: 1,5,3,8 → 3+30+15+24+16+72=167... optimal)
Unlock hints progressively — start gentle, go deeper only if needed.
Level 1: Gentle Nudge
A subtle direction
Level 2: Approach
The algorithm to use
Level 3: Detailed
Step-by-step guidance
to save progress and use AI features