Round 1 (DSA)
Questions:
- Reverse Linked List in K groups: https://leetcode.com/problems/reverse-nodes-in-k-group/
- Second question: Design a data structure to efficiently handle the following operations:
Input ["addWord","addWord","addWord","search","search","search","search"] [["bad"],["dad"],["mad"],["pad"],["bad"],[".ad"],["b.."]] Output [null,null,null,null,false,true,true,true]
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2 (Tech)
Questions:
- LLD question:
- Not able to recall the question but it involved warehouse and stores as two entities in Walmart that need to update stores when new inventory comes into the warehouse.
- Store to warehouse 1:1 mapping.
- Warehouse to store 1:N mapping.
- Remark: The candidate solved using the observer pattern, and the interviewer was also looking for the same.
- Asked multiple questions around implementation.
- Java Questions:
- Thread
- Java: Lambda function, anonymous class, functional interface, etc.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3 (HM)
Questions:
- Behavioral Questions:
- Any critical technical problem you've solved.
- Have you ever encountered a production bug, and how did you resolve it?
- Have you handled multiple projects at the same time? -> The candidate stated they had not yet.
- Why do you want to leave your current organization, especially since you were recently promoted?
- What new things have you learned and implemented in your work?
- And many more.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Verdict: Selected
Note: After round 2, they took around 2 weeks to schedule the HM round.
Compensation details: Compensation Discussion