Senior Software Engineer at Uber

How it went

What they would tell you

How to prepare

Their background

Round by round

1. 1

   DSA Round 160 min

   You're given an undirected tree rooted at node 0, with node values in an array amount. Alice starts at node 0 and moves downwards towards a leaf. Bob starts at some node bob and moves upwards towards node 0. Both move one edge per second simultaneously. At each node:

   • If Alice arrives before Bob, she collects the full amount[i].
   • If they arrive at the same time, she gets half (amount[i] / 2).
   • If Bob arrives before Alice, she gets nothing. Your task is to determine the maximum net income Alice can obtain by heading toward an optimally chosen leaf.
   • Most Profitable Path in a Tree
2. 2

   DSA Round 260 min

   Some 2D array related problem, i do not remember exact problem

   • Bomb Enemy
3. 3

   HLD60 min

   Problem Brief- Restaurant owners need real‑time aggregated metrics about orders placed via a food‑delivery platform

4. 4

   Low level design60 min

   Design a vehicle rental solution with user-defined configurations

What came up