163. Burst Balloons

Hard

Topics

Companies

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input: nums = [3,1,5,8]

Output: 167

Explanation: nums = [3,1,5,8] --> [3,5,8] --> [3,8] --> [8] --> [] coins = 3*1*5 + 3*5*8 + 1*3*8 + 1*8*1 = 167. The optimal bursting order yields a maximum of 167 coins.

Example 2:

Input: nums = [1,5]

Output: 10

Explanation: The optimal bursting order yields a maximum of 10 coins.

Constraints:

•
•

Time Complexity

O(n³)

Space Complexity

O(n²)

163. Burst Balloons

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Constraints:

Learn

Topics

Companies

Hint

Use Cases

163. Burst Balloons

Understand Before Coding

Visualize This Problem

Draw Your Approach

Example 1:

Example 2:

Constraints:

Learn

Topics

Companies

Hint

Use Cases