Re:Dynamic Programming vs. Divide-and-Conquer (2018)
by kccqzy on Sunday April 25, 2021 @02:48PM
(#26935398)
That's exactly how I approach these problems: I think that's a hard problem so how about just a brute force solution first to validate correctness? Then a few minutes later you realize the repeated subproblem structure and turn brute force into DP.
[ Parent
| on HN ]
There are no comments on this comment yet.