My InterviewsPracticeLearnPricingAbout
Theme

Uber Coding Interview Questions

We track 344 coding questions asked at Uber, tagged with the algorithms and concepts they test. The most common: Array, Hash Table, String, Breadth-First Search, Depth-First Search.

Browse all 344 Uber questions →

Concept mix

Each question's weight is split evenly across its concepts, so the shares sum to 100%.

Array — 19.7%String — 7.6%Hash Table — 6.7%Dynamic Programming — 5.6%Breadth-First Search — 4.3%Binary Search — 4.1%Math — 4.1%Depth-First Search — 3.5%Matrix — 3.2%Sorting — 3.1%Other (52) — 38.1%

How many questions involve each concept

Share of all 344 tracked Uber questions that touch each concept. Questions usually involve several, so these overlap.

Where Uber differs from the average company

Concept weight at Uber relative to the average across all companies we track. Green means Uber leans on it harder than most.

Uber specialties

Concepts that show up at Uber but are rarely asked elsewhere. They are easy to get blindsided by.

Difficulty mix

Level split of the 344 tracked Uber questions.

  • Junior13% (46)
  • Mid/Senior58% (201)
  • Staff28% (97)

Every concept in Uber interviews

ConceptQuestions% of questionsShare of mix
Array20860.5%19.7%
Hash Table8023.3%6.7%
String7321.2%7.6%
Breadth-First Search6017.4%4.3%
Depth-First Search5215.1%3.5%
Dynamic Programming5215.1%5.6%
Binary Search4412.8%4.1%
Sorting4412.8%3.1%
Matrix4011.6%3.2%
Math3911.3%4.1%
Graph Theory3610.5%2.7%
Heap (Priority Queue)319.0%2.1%
Two Pointers267.6%2.9%
Union-Find257.3%1.8%
Greedy247.0%2.2%
Tree236.7%1.6%
Design226.4%1.7%
Stack205.8%2.0%
Prefix Sum195.5%1.5%
Sliding Window195.5%1.7%
Simulation154.4%1.4%
Binary Tree144.1%1.0%
Linked List144.1%1.5%
Backtracking133.8%1.2%
Counting133.8%0.9%
Ordered Set133.8%0.9%
Trie133.8%0.8%
Divide and Conquer92.6%0.7%
Bit Manipulation82.3%0.7%
Topological Sort82.3%0.6%
Monotonic Stack72.0%0.6%
Recursion72.0%0.8%
Shortest Path72.0%0.4%
Memoization61.7%0.4%
Queue61.7%0.4%
Randomized61.7%0.4%
Doubly-Linked List51.5%0.3%
Enumeration51.5%0.5%
Hash Function51.5%0.3%
Number Theory51.5%0.4%
Segment Tree51.5%0.4%
Binary Search Tree41.2%0.3%
Monotonic Queue41.2%0.2%
Rolling Hash41.2%0.3%
String Matching41.2%0.4%
Geometry30.9%0.2%
Binary Indexed Tree20.6%0.1%
Bucket Sort20.6%0.1%
Data Stream20.6%0.1%
Database20.6%0.6%
Game Theory20.6%0.1%
Sweep Line20.6%0.1%
Minimum Spanning Tree20.6%0.1%
Quickselect20.6%0.1%
Bitmask10.3%0.1%
Combinatorics10.3%0.1%
Eulerian Circuit10.3%0.0%
Iterator10.3%0.1%
Merge Sort10.3%0.1%
Reservoir Sampling10.3%0.0%
Sort10.3%0.1%
Strongly Connected Component10.3%0.1%

Practice a Uber interview

Take a realistic AI-led mock interview with questions Uber actually asks, with live voice and real feedback.

Start a mock interview

Your first interview is free · no credit card required