All rounds were elimination rounds

Round 1: Online Assessment on Hackerrank
Questions:

1. Variation of Minimum moves to reach destination in a grid - BFS (70 marks)
2. 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.

Round 2: Coding round
Question has two parts. If one part is solved, then next part is asked by the interviewer.

1. Find maximum product subarray - Link
2. Find the start and end indices of the subarray whose product is maximum.
   eg. 1 4 -3 2 6 1 0 =>. startIndex = 3, endIndex = 5 (2,6,1 with product 12)

Round 3: Application Design Round
Asked to implement class diagram(LLD) of Automated Parking Lot on Hackerrank whiteboard. Design DB Schema, API specifications.