Solution: Burst Balloons
Let’s solve the Burst Balloons problem using the Dynamic Programming pattern.
We'll cover the following...
Statement
You are given nums.
When you burst a balloon nums[i - 1] * nums[i] * nums[i + 1].
If either
Ask