@konstantinrebrov675

Wow, it's a very unique insight for dynamic programming, that it's actually originally a recursive problem that can be represented as recursion tree. And then we optimize it.

@brianheartwood2071

I lolled at the voice. thanks man this was informative and great.

@christofu_

Don't you only have to iterate over half the rod length because there will be redundancies with symmetrical cuts? I.E if you had a rod of length 10, it would be redundant to check cuts (3,7) and (7,3) as the result would be the same?