SDE II at Uber

How it went

What they would tell you

How to prepare

Their background

Round by round

1. 1

   Screening Round45 min

   Rotten Oranges problem was asked, solved using BFS with a queue, discussed edge scenarios, and i was able to pass all test cases

   • Rotten Oranges
2. 2

   Coding round 160 min

   Problem Statement: Given an array containing each number from 1 to n exactly once, what is the minimum number of rounds needed to collect all numbers in increasing order by scanning left-to-right and picking up valid numbers each pass? I opted for a greedy method, used position tracking, and implemented the solution cleanly.

3. 3

   LLD60 min

   The LLD challenge was to design a simplified version of a Skip List. I asked clarifying questions about operations and performance.

   • Classes: SkipNode and SkipList, each with linked pointers at multiple levels.
   • Operations: Insert, delete, and search, maintaining probabilistic height assignment for new nodes. I coded up insert and search , discussed test strategies for various scenarios.
4. 4

   HLD60 min

   Problem: Design an Autocomplete System (for an E-commerce Platform)

What came up