Google phone screen | L4
Anonymous User
639

I had my phone screening round with Google yesterday. The main question was based on hashing, and I initially solved it with a time complexity of 𝑂(𝑁^2). The interviewer provided several hints for optimizing the time complexity, and I was able to incorporate those and complete the code. I also solved the follow-up question. My code had some bugs, which the interviewer pointed out, but I managed to fix them. What are my chances of qualifying?

Update: REJECTED due to taking multiple hints, bugs in the code.

Comments (3)