News for hackers. Stuff that matters.

A comment on Harder programming questions do a worse job of predicting outcomes. Parent comment

Re:Harder programming questions do a worse job of predicting... by ensiferum on Monday February 18, 2019 @01:45PM (#19193075)
examples of hard (subjective), recursive algorithms, anything that requires dynamic programming, generating permutations/subsets, problems that require a "de facto" memorized algorithm such as tree/graph traversals, coloring of subsets etc.

easy.. anything that is not hard :-)

[ Parent | on HN ]
Re:Harder programming questions do a worse job of predicting... by pixeloution on Monday February 18, 2019 @02:27PM (#19193496)
And here's the problem. People don't agree what's hard/easy. If I ask you to find duplicate values in a nested data structure (arrays of arrays) ... that calls for recursion. I think that's easy.

So I'm curious how they define hard/easy.

[ Parent | on HN ]