0
U

Uber

Just started

The bar: Comfort with graphs and real-time systems thinking.

Problem statements are often dressed as rider and driver scenarios.

6
ready

Early days. Work the Uber sheet in order and let the planner pace you.

The loop
  1. 1
    Phone screen

    One medium to hard problem, usually graph or map flavoured.

  2. 2
    Onsite coding

    Two rounds, one algorithmic and one closer to real service code.

  3. 3
    Design

    System design that almost always touches maps, matching or dispatch.

What actually matters here
  • Shortest path and grid problems are the house speciality.
  • Expect the interviewer to extend the problem into a distributed setting.
  • Practise implementing Dijkstra from memory, cleanly.
Difficulty mix they ask
10% easy60% medium30% hard
your easy coverage0%
your medium coverage0%
your hard coverage0%

Uber sheet

Ordered by how much this company cares about the topic, then by how often the problem appears.

0 / 50 solved
The core set for this company.
55 reported by candidates15 matched to their focus topics
0 / 50 solved
1
2
3
4
MDesign (LLD)
5
6
HGraphs
7
8
9
10
11
MHeap / Priority Queue
12
MHeap / Priority Queue
13
MIntervals
14
MIntervals
15
MDynamic Programming
16
MDynamic Programming
17
MHeap / Priority Queue
18
HDynamic Programming
19
20
21
MTwo Pointers
22
MRecursion & Backtracking
23
24
25
26
27
28
29
30
31
MRecursion & Backtracking
32
MRecursion & Backtracking
33
MHeap / Priority Queue
34
35
36
37
38
MStacks & Queues
39
HRecursion & Backtracking
40
MDesign (LLD)
41
HDesign (LLD)
42
EHashing
43
44
MHashing
45
46
HDynamic Programming
47
48
49
MStacks & Queues
50