Technical Phone Screen
Questions:
- Check if a linked list is Circular Linked List
- Kth Largest Element in an Array
- 5-10 mins, Java DSA Questions
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 1
Questions:
- Kth Smallest Element in an Array
- K-way merge algorithm (Algo/TC/SC Discussion only)
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2
Questions:
- Given Paths (45 mins):
- /abc/def/ghi,
- jkl/mno/pqr,
- stu/vwx/yz
- Write a method to return all unique directories and files from the list.
- Followup: Return directories and files separately
- Followup: Discussion only for being able to return in hierarchical format (Tree)
- System Design: Restaurant Management (15 mins)
- Class Diagrams only
- Scalable Options (LB, Caching) and theoretical questions.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
HM - Round 3
Questions:
- Coding (40 mins)
- Merge 2 sorted List
- Follow up: Merge k sorted list (Divide and Conquer Algorithm)
- System Design (25 mins) - TinyUrl (Complete)
- Behavioural Questions (15 mins)
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.