Uber
Fast, practical loops — coding rounds under real time pressure, then a design round on marketplace and real-time systems.
Typical loop
- 1Recruiter screen
- 2Technical phone screen
- 3Onsite: two to three coding rounds
- 4System design round
- 5Behavioral round
Questions
Callback's practice questions and the LeetCode questions Uber has been asking, filtered together.
Asked on LeetCode
359 questions · all time
- Median of Two Sorted ArrayshardArrayBinary SearchDivide and Conquerfrequency 27.8
- Meeting SchedulermediumArrayTwo PointersSortingfrequency 27.8
- Minimum Jumps to Reach End via Prime TeleportationmediumArrayHash TableMathBreadth-First Search+1frequency 27.8
- Minimum Knight MovesmediumBreadth-First SearchHeuristic SearchBidirectional SearchA* Searchfrequency 27.8
- Minimum Number of Taps to Open to Water a GardenhardArrayDynamic ProgrammingGreedyfrequency 27.8
- Move ZeroeseasyArrayTwo Pointersfrequency 27.8
- Number of Flowers in Full BloomhardArrayHash TableBinary SearchSorting+2frequency 27.8
- Number of Subarrays That Match a Pattern ImediumArrayRolling HashString MatchingHash Functionfrequency 27.8
- Number of Ways to Form a Target String Given a DictionaryhardArrayStringDynamic Programmingfrequency 27.8
- Put Marbles in BagshardArrayGreedySortingHeap (Priority Queue)frequency 27.8
- Random Point in Non-overlapping RectanglesmediumArrayMathBinary SearchReservoir Sampling+3frequency 27.8
- Remove CommentsmediumArrayStringfrequency 27.8
- Remove ElementeasyArrayTwo Pointersfrequency 27.8
- Remove Sub-Folders from the FilesystemmediumArrayStringDepth-First SearchTriefrequency 27.8
- Shortest Path in Binary MatrixmediumArrayBreadth-First SearchMatrixfrequency 27.8
- Smallest String With SwapsmediumArrayHash TableStringDepth-First Search+3frequency 27.8
- Sqrt(x)easyMathBinary SearchNewton's Methodfrequency 27.8
- Surrounded RegionsmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 27.8
- Walls and GatesmediumArrayBreadth-First SearchMatrixfrequency 27.8
- 01 MatrixmediumArrayDynamic ProgrammingBreadth-First SearchMatrixfrequency 20.3
- 2 Keys KeyboardmediumMathDynamic Programmingfrequency 20.3
- Add Two NumbersmediumLinked ListMathRecursionfrequency 20.3
- Amount of New Area Painted Each DayhardArraySegment TreeOrdered Setfrequency 20.3
- Amount of Time for Binary Tree to Be InfectedmediumHash TableTreeDepth-First SearchBreadth-First Search+1frequency 20.3
- Binary Tree CamerashardDynamic ProgrammingTreeDepth-First SearchBinary Tree+1frequency 20.3
- Binary Tree Longest Consecutive Sequence IImediumTreeDepth-First SearchBinary TreeDP on Treesfrequency 20.3
- Bomb EnemymediumArrayDynamic ProgrammingMatrixfrequency 20.3
- Cache With Time Limitmediumfrequency 20.3
- Candy CrushmediumArrayTwo PointersMatrixSimulationfrequency 20.3
- Checking Existence of Edge Length Limited PathshardArrayTwo PointersUnion-FindGraph Theory+1frequency 20.3
- Closest Binary Search Tree ValueeasyBinary SearchTreeDepth-First SearchBinary Search Tree+1frequency 20.3
- Container With Most WatermediumArrayTwo PointersGreedyfrequency 20.3
- Count Binary SubstringseasyTwo PointersStringfrequency 20.3
- Count Different Palindromic SubsequenceshardStringDynamic Programmingfrequency 20.3
- Count Integers in IntervalshardDesignSegment TreeOrdered Setfrequency 20.3
- Count Palindromic SubsequenceshardStringDynamic Programmingfrequency 20.3
- Count Prefix and Suffix Pairs IIhardArrayStringTrieRolling Hash+3frequency 20.3
- Count the Number of Good SubarraysmediumArrayHash TableSliding Windowfrequency 20.3
- Design Parking SystemeasyDesignSimulationCountingfrequency 20.3
- Design Snake GamemediumArrayHash TableDesignQueue+1frequency 20.3
- Design TwittermediumHash TableLinked ListDesignHeap (Priority Queue)frequency 20.3
- Find All People With SecrethardDepth-First SearchBreadth-First SearchUnion-FindGraph Theory+1frequency 20.3
- Find Duplicate SubtreesmediumHash TableTreeDepth-First SearchBinary Treefrequency 20.3
- Find K Closest ElementsmediumArrayTwo PointersBinary SearchSliding Window+2frequency 20.3
- Find K-th Smallest Pair DistancehardArrayTwo PointersBinary SearchSortingfrequency 20.3
- Find a Peak Element IImediumArrayBinary SearchMatrixfrequency 20.3
- Find the CelebritymediumTwo PointersGraph TheoryInteractivefrequency 20.3
- Find the Maximum Length of Valid Subsequence IImediumArrayDynamic Programmingfrequency 20.3
- Find the Most Competitive SubsequencemediumArrayStackGreedyMonotonic Stackfrequency 20.3
- Fizz BuzzeasyMathStringSimulationfrequency 20.3