eapache comments on 3 Interview-like Algorithm Questions for Programmers

[eapache]

For Question #1, I think you mean “lowest big-O complexity” not “fastest”, since constant factors matter a lot for actual fastest.

[lsusr]

I do indeed mean “lowest big-O complexity”.