1 session with HR, just verifying if I am interested, when I am free, etc.

3 technical/Bar-Raising interviews scheduled over a span of a week.

1 session with HR confirming my existing employment, notice period, etc.

Technical Round 1

Q1: Variation of Celebrity Problem Given a square matrix of n, where matrix[i][j] = 1 indicates that employee i "acknowledges" employee j. Determine the "ultimate employee" – an employee acknowledged by all, but who does not acknowledge anyone else. If no ultimate employee exists, return -1.

Q2: Some kind of BFS problem. Consider a graph of Amazon "Fulfilment Center" (Root) and Delivery Stations [Node]. The FC Manager wants to know how many Delivery Stations require traversing through X intermediate Delivery Stations.

Technical Round 2

Q1: Variation of subarray with sum k. Calculate subarrays where the sum of elements equals the length of the subarray.

Q2: BFS type problem - Rotten Oranges. Find the least number of "iterations" for all oranges to become rotten. A rotten orange at index (i, j) can rot all of its neighbors (up, down, left, right). If it is impossible to rot every orange, return -1.

Behavioral Questions: Have you ever gone above and beyond what your role demands? Have you ever had to work on a very tight deadline? Have you ever had to go out of your way to dive deep and learn something for the job?