3 ms·
I stopped reading in the middle. I sympathize quite a bit with his frustration, but he does a good job of making it difficult to sympathize with him. He goes o
by BeetleB 8y ago
I stopped reading in the middle.
I sympathize quite a bit with his frustration, but he does a good job of making it difficult to sympathize with him. He goes on about how there are books written on how to interview at Google, yet it's patently clear he didn't even try to read one of them. It's one thing not to know BFS on the spot because you didn't want to prepare. It's another thing to be totally shocked that they asked the question. A few minutes of searching the Internet, or casually browsing the table of contents of several books, would give you an idea of what they want you to know.
And not to defend Google or other companies, but frankly, BFS is not some super complicated academic problem that only smart people can code on the fly. It is one of the more basic recursive[0] algorithms there. So even if you haven't memorized it, it's not ridiculous to expect you to "derive" it.
And equating maze solving with AI. Really?
I've gone to interviews without preparation, just because "Why not?" However, I don't go on a rant when I do poorly on it.
[0] Actually, it need not be recursive.
- scarmig 8y agoBFS isn't really suited for recursive solutions. Trying to do so usually amounts to trying to write BFS with a stack only.