"Many programmers can't FizzBuzz" sounds like a scary bedtime tale. Then you do hiring, and the boogeyman springs to horrifying life.
@markwshead Our go-to one was "Return a list of all words in text A that are not in text B." O(n^2) solutions were pleasant surprises.
-
-
@patio11 I'm trying to imagine how you could approach that problem and make it worse than O(n^2).Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.