Round 1: DSA
Questions:
- A dynamic programming problem to maximize an amount.
- Initially, a recursive solution was provided, followed by a tabulation approach. The interviewer then asked for a memoization solution without using an nXn array.
- Print zig-zag traversal of a binary tree.
- The interviewer requested the code to work correctly on the first attempt without any errors.
Candidate's Approach
- For the first question, the candidate provided three approaches: recursive, tabulation, and memoization.
- The candidate was able to explain the memoization solution effectively, which pleased the interviewer.
- The candidate was required to code all three approaches.
Interviewer's Feedback
The interviewer was happy with the candidate's approach to the dynamic programming problem.
Round 2: LLD
Questions:
- A low-level design question requiring the candidate to create a class diagram and code part of it.
Candidate's Approach
No approach provided.
Interviewer's Feedback
Feedback was positive.
Round 3: HLD
Questions:
- The interviewer started with an introduction and asked about the candidate's current work and projects.
- The candidate was given a high-level design question that was not standard and was discussed for about an hour. The expectations included drawing the HLD and explaining the use of any databases or queues.
Candidate's Approach
The candidate enjoyed this round, which felt more like a discussion. They were able to engage in a detailed conversation about the design.
Interviewer's Feedback
Feedback was positive, and the interviewer was described as sweet and engaging.
Round 4: Director Round
Questions:
- The director asked about the candidate's current organization and expressed dissatisfaction with the responses.
- Questions about the candidate's academic performance were also posed.
Candidate's Approach
The candidate felt the director was not receptive to their answers but maintained politeness throughout the questioning.
Interviewer's Feedback
No feedback provided.