Round 1
Questions:
- Given an integer array of size n. Elements of the array are >= 0. Starting from arr[startIndex], follow each element to the index it points to. Detect if there is a loop in the array and return its length. If no loop found, return -1.
- Variation of Leetcode Problem with fixed k = 3.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2
Questions:
- Leetcode Problem - Interviewer wanted O(h) solution using BST Iterator.
- Leetcode Problem.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3
Questions:
- Discussion around current project, mostly deep dive.
- Standard questions on SOLID principles, design patterns (composite, factory, singleton and proxy).
- Implement LRU Cache taking care of OOPS and Design Principles.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.