Round 1 DSA:

There is a binary tree with each node having value and also reference to parent pointer.
A starts from root Node and B starts from some leaf node.
calcuate the maximum points A can collect if A moves downward and B moves up with below condition

1. If node is visited by B first, A gets 0 and vice versa
2. If both visits at the same time, both gets half value

Round 2 DSA:

Given two inputs,

First input is the location map, a 2D array

| O | E | E | E | X |
| E | O | X | X | X |
| E | E | E | E | E |
| X | E | O | E | E |
| X | E | X | E | X |

O = Robot, E = Empty, X = blocker

Second input is the query array. It’s a 1D array consisting of distance to the closest blocker in the order from left, top, bottom and right
[2, 2, 4, 1]

This means distance of 2 to the left blocker, 2 to the top blocker, 4 to the bottom blocker and 1 to the right blocker

Note: The location map boundary is also considered blocker, meaning if the robot hits the boundary it also means it’s hitting the blocker.
Return the coordinates of all robots who can satisfy move given by second input.

Round 3 High level design

Consider food orders placed from different restaurants via uber eats app.
Restaurant owners want to view aggregated metrics related to their orders in real time

1. Total value of all orders placed in their restaurant for various time intervals - last 1 hour, 1 day, 1 week
2. List of top k food items that were ordered from their restaurant for various time intervals - last 1 hour, 1 day, 1 week

Metrics should be real time as much as possible.

Round 4 Low level design

There are fixed number of meeting rooms with various sizes. Given a start time and end time, need to book available meeting room.
Also need to Maintain past booking history of meeting rooms.
Interviewer expected to abstract different types of implementations for meeting room scheduling.
Fully working code is expected in 1 hour.

Round 5 Hiring Manager round

There were some standard behavioural questions.
Post that he asked to explain complete architecture of the most complex system which I have built in my past.
He asked many follow up questions during my explanation like design trade offs, challenges faced, learnings, choice of tech stack etc.

The entire process took around 2 months

offer details: https://leetcode.com/discuss/post/7166280/uber-india-l5-sse-bengaluru-by-anonymous-zgan/