Round 1: Online Assessment
Questions:
- Two DSA questions were given:
- Question 1: An n * m maze. Moved from top left to bottom right. Each move you can take up to k steps. Find the minimum number of moves.
- Solution is straightforward BFS.
- Question 2: Specific question not provided, but it was easy.
- Question 1: An n * m maze. Moved from top left to bottom right. Each move you can take up to k steps. Find the minimum number of moves.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2: Coding Round
Questions:
- Question 1: Given coupons and categories they work on. Categories are hierarchical, and parent category coupons work for child categories. For a given category, find the nearest coupon that can be applied.
- Question 2: Coupons have a datetime. Optimize the algorithm such that the latest datetime coupons win.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3: Low Level Design
Questions:
- Question: The infamous Parking Lot: LeetCode Discussion
- Required to draw class diagrams and schema design.
- Faced intense questioning during class diagrams, leaving little time for API design.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 4: Hiring Manager & HR Rounds
Questions:
- Asked about projects and classic behavioral questions related to conflicts, toughest projects, etc.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Verdict: Rejected
Feedback:
- The candidate did not use Java during the rounds, which was considered a significant issue. Although the candidate inquired if Java was required and was told it wasn't, it still impacted the decision.
- The combined performance in the Low Level Design and Hiring Manager round was noted as not positive.