Round 1: Online Coding Round
Questions:
- Specific question not provided.
- One question was from dynamic programming (LCS variation, harder side) which was solved by the candidate.
Candidate's Approach
The candidate managed to solve the dynamic programming question but did not remember the details of the second question.
Interviewer's Feedback
No feedback provided.
Round 2: DSA Round (45 minutes)
Questions:
- A connection of cities was given, and the candidate needed to find the farthest distance from all of the input cities.
- Example: a->h, b->h, h->c.
Candidate's Approach
The candidate explained a brute-force BFS approach and then optimized it using Dijkstra's algorithm. They discussed the time and space complexity but did not clarify the input format before starting to code, which led to a misunderstanding.
Interviewer's Feedback
The interviewer noted that the candidate was on the right track with the Dijkstra's algorithm and asked about time and space complexity.
Round 3: DSA + Googliness Round
Questions:
- A simple hash map question (easy level) with follow-up questions.
- A sliding window problem that was tricky.
Candidate's Approach
The candidate solved the hash map question and the sliding window problem on paper before coding it. They explained the space and time complexity for both problems.
Interviewer's Feedback
The interviewer was impressed with the candidate's performance in this round.