I applied through another source. The process took 3 months.

There were 3 interview rounds with 4 total parts:

• The first round is an HR round where the HR speaks to you about your experience and how fit you are for the company.
• The second is a programming test, where you will be asked LeetCode medium to hard questions.
• Part 2 of the first round includes a general test, including algorithm design questions and general mathematical questions, like designing/describing a shortest route algorithm for their drivers and such.
• The final round I received was a 30-minute live coding round.

This was the difficult question I remember they asked. It's a variant of this question. Leetcode 489. Robot Room Cleaner.

Control a robot with only move/turn/clean APIs to traverse and clean every reachable cell in an unknown grid with obstacles and no global map. The challenge is to explore the entire accessible area using DFS/backtracking while tracking visited coordinates and managing orientation to avoid revisiting or getting stuck.

DESCRIPTION Control a robot with only move/turn/clean APIs to traverse and clean every reachable cell in an unknown grid with obstacles and no global map. The challenge is to explore the entire accessible area using DFS/backtracking while tracking visited coordinates and managing orientation to avoid revisiting or getting stuck.

Input:

• room = [[1,1,1,1,1,0,1,1], [1,1,1,1,1,0,1,1], [1,0,1,1,1,1,1,1], [0,0,0,1,0,0,0,0], [1,1,1,1,1,1,1,1]]
• row = 1
• col = 3

Output: Robot cleans all reachable cells

Explanation: The robot starts at position (1,3) and explores the entire reachable area using DFS with backtracking. Cells with 0 are obstacles, cells with 1 are cleanable.

Constraints:

• 1 <= room.length <= 100
• 1 <= room[i].length <= 200
• room[i][j] is either 0 (obstacle) or 1 (cleanable)
• The robot starts in a cleanable cell
• All cleanable cells are connected (reachable from the starting position)

Robot APIs: move() returns boolean, turnLeft() and clean() return void