Uber Coding Interview Questions: 47 Tagged Problems
47 coding problems tagged Uber — 2 easy · 29 medium · 16 hard — with solutions in 13 languages. Plus a 4-week study plan by topic.
- Problems: 47
- By difficulty: 2 easy · 29 medium · 16 hard
- Languages: JavaScript, TypeScript, Python, Java, C++, C, C#, Go, Kotlin, Swift, Rust, PHP and Ruby
- Cost: Free on every plan; sign in to run and submit
47 problems the CodeKairo catalogue tags as commonly asked in Uber's coding rounds — 2 easy, 29 medium and 16 hard — each judged by hidden tests in 13 languages. The most common topics among them are Arrays (33), Dynamic Programming (19) and Strings (12). The tag is the catalogue's own annotation of where a problem tends to come up — not a list published by Uber, which CodeKairo is not affiliated with.
Uber study plan by topic
40 of the 47 problems tagged Uber over 4 weeks, about 26 h 5 min of solving, grouped by technique in the order they build on each other — Counting, Two Pointers, Sliding Window and Prefix Sum and 13 more.
Week 1: Counting, Two Pointers, Sliding Window +2
12 problems on Counting, Two Pointers, Sliding Window, Prefix Sum and Binary Search, easiest first within each topic.
- Valid Anagram Easy
- Word Subsets Medium
- 3Sum With Multiplicity Medium
- Happy Number Easy
- Longest Nice Subarray Medium
- Minimum Window Subsequence Hard
- Maximum Value of an Ordered Triplet I Medium
- Construct Product Matrix Medium
- Minimum Sum of Mountain Triplets II Medium
- Minimum Number of K Consecutive Bit Flips Hard
- Minimum White Tiles After Covering With Carpets Hard
- Magnetic Force Between Two Balls Medium
Week 2: Stack, Monotonic Stack, Matrix +3
12 problems on Stack, Monotonic Stack, Matrix, Heap, Ordered Set and Bitmask, easiest first within each topic.
- Longest Well-Performing Interval Medium
- Minimum Deletions to Make String Balanced Medium
- Minimum Cost Tree From Leaf Values Medium
- Count Square Submatrices with All Ones Medium
- Valid Sudoku Medium
- Cherry Pickup Hard
- Top K Frequent Words Medium
- Kth Smallest Element in a Sorted Matrix Medium
- Find the Kth Smallest Sum of a Matrix With Sorted Rows Hard
- Minimum Number of Refueling Stops Hard
- Minimize Deviation in Array Hard
- Count the Number of Square-Free Subsets Hard
Week 3: Combinatorics, Trees, Breadth-First Search +1
9 problems on Combinatorics, Trees, Breadth-First Search and Union Find, easiest first within each topic.
- Count Anagrams Hard
- Count All Valid Pickup and Delivery Options Hard
- Minimum Fuel Cost to Report to the Capital Medium
- Number of Good Paths Hard
- As Far from Land as Possible Medium
- Open the Lock Medium
- Bus Routes Hard
- Number of Closed Islands Medium
- Smallest String With Swaps Medium
Week 4: Dynamic Programming, Brainteaser
7 problems on Dynamic Programming and Brainteaser, easiest first within each topic.
All problems tagged Uber
Easy (2)
- Happy Number Hash Table, Math, Two Pointers
- Valid Anagram Hash Table, String, Sorting
Medium (29)
- Corporate Flight Bookings Array, Prefix Sum
- Minimum Deletions to Make String Balanced String, Dynamic Programming, Stack
- Minimum Sum of Mountain Triplets II Array, Prefix Sum
- Single-Threaded CPU Array, Sorting, Heap (Priority Queue)
- Open the Lock Array, String, Breadth-First Search
- Minimum Fuel Cost to Report to the Capital Tree, Graph, Depth-First Search
- Largest Plus Sign Array, Matrix, Dynamic Programming
- Construct Product Matrix Array, Matrix, Prefix Sum
- Minimum Cost Tree From Leaf Values Array, Dynamic Programming, Stack
- Stone Game II Array, Dynamic Programming, Prefix Sum
- Magnetic Force Between Two Balls Array, Binary Search, Sorting
- 3Sum With Multiplicity Array, Hash Table, Two Pointers
- Longest Nice Subarray Bit Manipulation, Array, Sliding Window
- Decode XORed Permutation Bit Manipulation, Array, Brainteaser
- Longest Subarray With Maximum Bitwise AND Bit Manipulation, Array, Brainteaser
- Maximum Value of an Ordered Triplet I Array, Math, Prefix Sum
- Smallest String With Swaps Union Find, Hash Table, String
- Longest Well-Performing Interval Array, Hash Table, Prefix Sum
- Word Subsets String, Hash Table, Counting
- Count Substrings That Differ by One Character String, Dynamic Programming
- Longest Palindromic Subsequence String, Dynamic Programming
- As Far from Land as Possible Array, Dynamic Programming, Breadth-First Search
- Kth Smallest Element in a Sorted Matrix Array, Binary Search, Sorting
- Top K Frequent Words Array, Hash Table, String
- Best Sightseeing Pair Array, Dynamic Programming
- Minimum Cost For Tickets Array, Dynamic Programming
- Valid Sudoku Array, Hash Table, Matrix
- Number of Closed Islands Array, Depth-First Search, Breadth-First Search
- Count Square Submatrices with All Ones Array, Dynamic Programming, Matrix
Hard (16)
- Count All Valid Pickup and Delivery Options Math, Dynamic Programming, Combinatorics
- Minimum Cost to Split an Array Array, Hash Table, Dynamic Programming
- Count Different Palindromic Subsequences String, Dynamic Programming
- Count Anagrams Hash Table, Math, String
- Minimize Deviation in Array Array, Greedy, Heap (Priority Queue)
- Number of Good Paths Array, Tree, Graph
- Bus Routes Array, Hash Table, Breadth-First Search
- Minimum White Tiles After Covering With Carpets String, Dynamic Programming, Prefix Sum
- Cherry Pickup Array, Matrix, Dynamic Programming
- Burst Balloons Array, Dynamic Programming
- Minimum Number of Refueling Stops Array, Greedy, Dynamic Programming
- Find the Kth Smallest Sum of a Matrix With Sorted Rows Array, Matrix, Binary Search
- Minimum Number of K Consecutive Bit Flips Array, Sliding Window, Prefix Sum
- Minimum Window Subsequence String, Two Pointers, Dynamic Programming
- Count the Number of Square-Free Subsets Bit Manipulation, Dynamic Programming, Bitmask
- Count of Smaller Numbers After Self Array, Fenwick Tree, Divide and Conquer
Topics Uber asks most
- Arrays 33 problems
- Dynamic Programming 19 problems
- Strings 12 problems
- Hash Table 11 problems
- Matrix 9 problems
- Prefix Sum 8 problems
- Sorting 7 problems
- Counting 6 problems
- Heap 6 problems
- Math 5 problems
- Greedy 5 problems
- Bit Manipulation 5 problems