•CODING INTERVIEW QUESTIONS
Uber Coding Interview Questions (DSA)
50 DSA problems sourced from real Uber interviews
Uber Coding Interview Questions
| Problem | Difficulty | Tags |
|---|---|---|
| Number of Islands II | Hard | ArrayHash TableUnion-Find |
| Bus Routes | Hard | ArrayHash TableBreadth-First Search |
| Medium | ArrayDepth-First SearchBreadth-First Search | |
| First Unique Number | Medium | ArrayHash TableDesign |
| Minimum Edge Reversals So Every Node Is Reachable | Hard | Dynamic ProgrammingDepth-First SearchBreadth-First Search |
| Minimum Number of Refueling Stops | Hard | ArrayDynamic ProgrammingGreedy |
| Find the Safest Path in a Grid | Medium | ArrayBinary SearchBreadth-First Search |
| Making A Large Island | Hard | ArrayDepth-First SearchBreadth-First Search |
| Maximize Sum of Weights after Edge Removals | Hard | Dynamic ProgrammingTreeDepth-First Search |
| Word Search | Medium | ArrayStringBacktracking |
| Word Search II | Hard | ArrayStringBacktracking |
| Medium | TreeDepth-First SearchBinary Search Tree | |
| Evaluate Division | Medium | ArrayStringDepth-First Search |
| Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | ArrayQueueSliding Window |
| Find the Closest Palindrome | Hard | MathString |
| Construct Quad Tree | Medium | ArrayDivide and ConquerTree |
| Design Hit Counter | Medium | ArrayBinary SearchDesign |
| Insert Delete GetRandom O(1) | Medium | ArrayHash TableMath |
| Squares of a Sorted Array | Easy | ArrayTwo PointersSorting |
| Hard | ArrayStringDepth-First Search | |
| Medium | ArraySortingQuicksort | |
| Meeting Rooms III | Hard | ArrayHash TableSorting |
| Split Array Largest Sum | Hard | ArrayBinary SearchDynamic Programming |
| Final Prices With a Special Discount in a Shop | Easy | ArrayStackMonotonic Stack |
| Minimum Operations to Reduce an Integer to 0 | Medium | Dynamic ProgrammingGreedyBit Manipulation |
| Medium | ArrayBreadth-First SearchMatrix | |
| Count Paths That Can Form a Palindrome in a Tree | Hard | Hash TableBit ManipulationTree |
| The Earliest Moment When Everyone Become Friends | Medium | ArrayUnion-FindSorting |
| Leftmost Column with at Least a One | Medium | ArrayBinary SearchMatrix |
| Maximum Number of Points From Grid Queries | Hard | ArrayTwo PointersBreadth-First Search |
| Time Based Key-Value Store | Medium | Hash TableStringBinary Search |
| Medium | Depth-First SearchBreadth-First SearchGraph Theory | |
| Find Peak Element | Medium | ArrayBinary Search |
| Minimum Knight Moves | Medium | Breadth-First SearchHeuristic SearchBidirectional Search |
| Painting a Grid With Three Different Colors | Hard | Dynamic ProgrammingGraph Coloring |
| Shuffle an Array | Medium | ArrayMathDesign |
| Count the Number of Infection Sequences | Hard | ArrayMathCombinatorics |
| Binary Searchable Numbers in an Unsorted Array | Medium | ArrayBinary SearchStack |
| Minimum Fuel Cost to Report to the Capital | Medium | TreeDepth-First SearchBreadth-First Search |
| Hard | Two PointersDesignSorting | |
| Find Eventual Safe States | Medium | Depth-First SearchBreadth-First SearchGraph Theory |
| Hard | StringTreeDepth-First Search | |
| Make Lexicographically Smallest Array by Swapping Elements | Medium | ArrayUnion-FindSorting |
| Number of Wonderful Substrings | Medium | Hash TableStringBit Manipulation |
| Roman to Integer | Easy | Hash TableMathString |
| Number of Ways to Form a Target String Given a Dictionary | Hard | ArrayStringDynamic Programming |
| Number of Provinces | Medium | Depth-First SearchBreadth-First SearchUnion-Find |
| Design In-Memory File System | Hard | Hash TableStringDesign |
| Easy | ArrayHash Table | |
| Medium | Linked ListMathRecursion |
Difficulty Breakdown
Top Data Structures & Patterns
Frequently Asked Questions
What questions does Uber ask in coding interviews?
Uber coding interviews focus on A* Search, Array, Backtracking, Bellman–Ford Algorithm, and other data structure problems. We compiled 50 questions from real Uber interviews. The most common topics are A* Search, Array, Backtracking, Bellman–Ford Algorithm, Bidirectional Search. Filter by topic to see what comes up most often.
How many Uber coding interview questions are there?
InterviewSkool has 50 Uber coding interview questions: 4 Easy, 27 Medium, and 19 Hard. Most Uber interviews focus on Medium-difficulty problems, so prioritize those in your prep.
How should I prepare for Uber coding interviews?
Start with Medium difficulty problems. Group by topic (Array, Tree, DP) to build pattern recognition. Aim to solve 30 to 40 problems before your interview. Then practice under pressure with a mock interview.
Are Uber coding interview questions free?
Yes. All 50 Uber coding interview questions are free to browse with no sign-up required. You can filter by difficulty and topic tags. Start a mock interview with a free credit to practice under real pressure.
Practice with a Mock Interview
Simulate real Uber interview pressure with our AI interviewer.
Start Mock Interview →