5 ms·

I had the opposite experience in a Google interview. I just said, that can be solved with a topological sort, and then we moved on. But I failed with another

I had the opposite experience in a Google interview. I just said, that can be solved with a topological sort, and then we moved on. But I failed with another interviewer. He kept asking how to prevent hashing from producing collisions. The answer was universal hashing, but I had forgotten about that

phendrenad2 6y ago
Typical. Universal Hashing as a concept is only interesting to cryptographers, and people who are completely obsessed with obscure hashmap trivia (i.E. FAANG interviewers).