First Round (45 mins DSA)

• Question: Graph + String problem where nodes were strings.

• Approach: It was an implementation-heavy problem that could be solved using traversal techniques.

• My Solution: The interviewer was very friendly. I implemented BFS and solved it within the given time, without any hints.

• Follow-up: Interviewer asked one follow-up, solved easily using a heap.

• Verdict Prediction: Strong Hire / Hire ✅

Second Round (45 mins DSA + 15 mins Googliness)

• Question: Variation of the classic Coin Change problem (question is available on LeetCode).

• Experience: The interviewer was not very friendly and did not provide any hints. I kept trying to figure out the solution the entire time, exploring different possible approaches, but I couldn’t find the right one. As a result, I couldn’t write any code within the given 45 minutes.

• Googliness: Went fine.

• Verdict Prediction: Strong No Hire/ No Hire / Lean No Hire ❌

Current Status

• It’s been 2 weeks with no response, most likely rejected :(