Round 1 - DSA(1 hr)
Questions asked:
1. Given an array of integers arr, you are positioned at the first index of the array. In one step you can jump from index i to index:
i + 1 where: i + 1 < arr.length,
i - 1 where: i - 1 >= 0,
j where: arr[i] == arr[j] and i != j
Return the minimum number of steps to reach the last index of the array.
- Given an integer array representing the heights of tower, some boxes, and some rop
You start your journey from building 0 and move to the next by tower possibly using boxes or rope.
While moving from tower i to tower i+1 (0-indexed),
If the current tower height is greater than or equal to the next tower height, you do not need a boxes or rope.
If the current tower height is less than the next tower’s height, you can either use one rope or (h[i+1] - h[i]) boxes.
Return the farthest tower index (0-indexed) you can reach if you use the given rope and boxes optimally.
Round 2 - Technical(1 hr)
Deep dive into all the system and tech stack of project with pros and cons. Some discussion were around distributed transactions and how to ensure consistency. Common system design questions like what is CAP theorem? Difference between HTTP and HTTPs? , etc were asked.
Round 3 - LLD(1.5 hrs)
I was given Snake and Ladder game to design which was had some follow up questions as well.
The interviewer was interested more on the design and less on the actual working of the code
At the end, I zipped the code and sent to interviewer.