| I get the impression my claim is getting distorted. And I don't know how to make it clear. :( My claim is that some of these optimizations on BFS/DFS style questions were never something most people could effortlessly solve in a few seconds. Which is how I took the claim of the OP. If it was only the identification that was supposed to be seconds, with solutions taking time, that is one thing. But even binary search was infamous for not having a bug free solution for many many years. (Unless I took an urban legend too literally, of course.) Not to mention, most solutions people give in seconds are at best a good starting position. Just go look at how a typical sort is actually implemented. Much more involved than what you would want someone to do in a few seconds. I've literally seen folks that think someone should be able to write algorithms such as Knuth-Morris-Pratt in a standup interview. Which is just bonkers to me. I've also grown annoyed with interviews that are effectively, "how would you design google maps today?" Which really just comes down to have I already done that. At the least, studied it fairly in depth. Worse, the answer is almost certainly not much different than how it was built. |
Incorrect. My point is that some high GPA undergrads don't seem to have the habit/ability to even think along those lines. Of course we aren't going to ask for a difficult and polished algorithm in an interview. We throw simple stuff at them, to see if they know how to approach a problem. There are some common problems which are trivially solvable by imply throwing BFS/DFS at them. These 3.75+ GPA wunderkinds will flub those! At least one HN commenter replied to one by saying they could solve it in a couple of days.
Not to mention, most solutions people give in seconds are at best a good starting position.
Too many of these supposed A students can't even get to that starting position.
I've literally seen folks that think someone should be able to write algorithms such as Knuth-Morris-Pratt in a standup interview.
No. What we ask is more along the lines of: Would this candidate be able to think through what would happen if they used DFS on this graph? And that is just about the hardest thing we'd ask.