On: Dynamic programming bursting balloons

[SJC_Hacker]

This is fairly old Leetcode problem (who probably got it from somewhere else)

https://leetcode.com/problems/burst-balloons/description/

Its tricky and if I got this problem in a tech interview, I would be hard-pressed to solve it in 45 minutes if I hadn't seen it before

[dastbe → SJC_Hacker]

yeah, i would expect a candidate who hasn’t seen it before to have at best a 50/50 shot of realizing that the traversal is “in reverse” so to speak, and need a hint to move forward.

though once you know that i’d expect a candidate to bang it out fairly quickly. it’s not that many lines of code.