Neetcode Spaced Repetition System

312. Burst Balloons

Hard

2-D Dynamic Programming

Open on NeetCodeOpen on LeetCode

Optimal Complexity

Time

O(n ^ 3)

Space

O(n ^ 2)

Start First Attempt