Round 1
Questions:
- Variation of Minimum moves to reach destination in a grid - BFS (70 marks)
- Find all anagrams of a string and return the list (50 marks)
Score should be greater than 60 percent of the total score to pass this test.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 2
Questions:
- Find maximum product subarray - Link
- Find the start and end indices of the subarray whose product is maximum.
- Example: 1 4 -3 2 6 1 0 => startIndex = 3, endIndex = 5 (2,6,1 with product 12)
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.
Round 3
Questions: Asked to implement class diagram (LLD) of Automated Parking Lot on Hackerrank whiteboard. Design DB Schema, API specifications.
Candidate's Approach
No approach provided.
Interviewer's Feedback
No feedback provided.