Phone Screening
Questions: A Tree based DFS question with 2 follow-ups (medium-hard). Solved it quickly but missed an edge case.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Onsite 1 (Best round)
Questions: It was a dynamic programming question, a spicy variation on Longest Increasing Subsequence (LIS) with 2 follow-ups.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Onsite 2 (Hell round)
Questions: It was a hashmap question (easy-medium), but the question was vague, taking 5-10 minutes to clarify the requirements. Solved it with the required complexity. The follow-up question was challenging, as the interviewer asked to "look at the code & do something" without hints or direction.
Candidate's Approach
Proposed 2-3 enhancements but received no clear feedback from the interviewer. Ultimately agreed on a linked-list approach but missed a null pointer check and had bugs in the Java linked-list implementation.
Interviewer's Feedback
No feedback provided.
Onsite 3 (Decent-good round)
Questions: It was a graph question (medium-hard) that could be solved with DFS/BFS. The follow-up was tricky, involving DFS/BFS + DP.
Candidate's Approach
Explained the approach but struggled to articulate it clearly due to recursion. Made some mistakes regarding the number of edges and complexity calculations but eventually agreed on O(V + E) with the interviewer.
Interviewer's Feedback
The interviewer was very helpful throughout the discussion.
Googliness
Questions: Self Verdict: Hire/ Strong Hire
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.