NeetCode #741LC-312Hard2-D Dynamic ProgrammingNC 150NC 250
← Back to All Problems#741 · #312 · Burst Balloons(戳气球)
📌 Problem Statement & Constraints
Given
nums representing balloons, bursting balloon i yields nums[i-1] * nums[i] * nums[i+1] coins, where out-of-range neighbours count as 1. After bursting, the remaining balloons close the gap. Return the maximum coins from bursting all balloons. Constraints: 1 <= nums.length <= 300, 0 <= nums[i] <= 100.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!