News for hackers. Stuff that matters.
Re:Ask HN: What % of your job interviewees pass FizzBuzz typ... by Someone on Wednesday September 28, 2011 @03:15AM (#3046849)
"Another good permutation problem, is subset sum problem. [...] Is it possible to get better than O(n^2) for the optimal solution."

AFAIK subset sum is NP complete, so I guess you meant O(2^n). Even so, I would not expect a programmer to tell me much about it.

There are no comments on this comment yet.