solulubeta
Sign in
NeetCode 150 / 2-D Dynamic Programming
14.10 · Problem

Burst Balloons

Hard Interval DP: choose the last balloon 1 video LC 312 Pro

This problem is part of solulu Pro

Balloons have numbers nums[i]. Bursting balloon i earns nums[left] · nums[i] · nums[right], where left and right are its current neighbours (treat missing neighbours as 1). After bursting, its neighbours become adjacent.…

Lifetime ₹1,999 ₹999 · Launch offer
Mark this problem as solved when you are finished.

Item 120 of 150 · updated 2026-10-12