Re:Many Hard LeetCode Problems Are Easy Constraint Problems
by zahlman on Saturday September 13, 2025 @11:01AM
(#45232634)
> or from n*2 to n log n.
I guess you mean n^2 (or maybe n**2, if you're a fellow Pythonista). Many of these — especially the ones where the intended solution is characterized as using a "dynamic programming" technique — are reducible to n.
I guess you mean n^2 (or maybe n**2, if you're a fellow Pythonista). Many of these — especially the ones where the intended solution is characterized as using a "dynamic programming" technique — are reducible to n.