News for hackers. Stuff that matters.
Re:Solving dynamic programming interview problems by davidcbc on Friday May 18, 2018 @09:34PM (#17106147)
> You should not be blamed for assuming, when talking to Google, that the O(n!) or O(n^2) solution is not even worth talking about.

If the naive solution is O(n!) then describing an O(n^2) solution is perfectly acceptable.

Re:Solving dynamic programming interview problems by zodiac on Saturday May 19, 2018 @05:42AM (#17107238)
Interesting fact: the standard DP algorithm for TSP reduces the running time from O(n!) to O(n^2 2^n)