Grokking the Coding Interview Patterns/

...

/

Solution: Burst Balloons

Solution: Burst Balloons

Let’s solve the Burst Balloons problem using the Dynamic Programming pattern.

We'll cover the following...

Statement

You are given nn balloons, numbered from 00 to n−1n - 1. Each balloon has a number painted on it, represented by an integer array nums.

When you burst a balloon ii, you earn coins equal to nums[i - 1] * nums[i] * nums[i + 1].
If either i−1i - 1 or i+1i + 1 ...