Uber LeetCode Interview Questions
Practice 359 coding problems currently tagged to Uber. Use the frequency and topic signals to build a focused software engineering interview practice plan.
Last updated:
45 Easy
209 Medium
105 Hard
Top Topics at Uber
Ace your Uber interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Uber LeetCode Interview Questions
| Problem | DifficultyDiff | Action |
|---|---|---|
Bus Routes 100% | HardH | Solve→ |
Alien Dictionary 95.2% | HardH | Solve→ |
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit 94.4% | MediumM | Solve→ |
Number of Islands 89.9% | MediumM | Solve→ |
Number of Islands II 89.9% | HardH | Solve→ |
Construct Quad Tree 87% | MediumM | Solve→ |
Squares of a Sorted Array 85.8% | EasyE | Solve→ |
First Unique Number 83.2% | MediumM | Solve→ |
Kth Smallest Element in a BST 82.3% | MediumM | Solve→ |
Find the Closest Palindrome 80.8% | HardH | Solve→ |
Word Search 78% | MediumM | Solve→ |
Minimum Edge Reversals So Every Node Is Reachable 76.8% | HardH | Solve→ |
LRU Cache 76.2% | MediumM | Solve→ |
Design Hit Counter 76.2% | MediumM | Solve→ |
Insert Delete GetRandom O(1) 76.2% | MediumM | Solve→ |
Word Search II 73.4% | HardH | Solve→ |
My Calendar I 73.4% | MediumM | Solve→ |
Best Time to Buy and Sell Stock 71.9% | EasyE | Solve→ |
Count Paths That Can Form a Palindrome in a Tree 71.9% | HardH | Solve→ |
Product of Array Except Self 71.1% | MediumM | Solve→ |
Evaluate Division 70.2% | MediumM | Solve→ |
Text Justification 69.3% | HardH | Solve→ |
Block Placement Queries 68.4% | HardH | Solve→ |
Making A Large Island 67.4% | HardH | Solve→ |
Random Pick with Weight 67.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Leftmost Column with at Least a One 66.4% | MediumM | Solve→ |
Course Schedule II 65.4% | MediumM | Solve→ |
Find Minimum Time to Reach Last Room I 65.4% | MediumM | Solve→ |
Valid Sudoku 64.3% | MediumM | Solve→ |
Spiral Matrix 64.3% | MediumM | Solve→ |
Final Prices With a Special Discount in a Shop 63.1% | EasyE | Solve→ |
The Earliest Moment When Everyone Become Friends 63.1% | MediumM | Solve→ |
Course Schedule 61.8% | MediumM | Solve→ |
Basic Calculator 61.8% | HardH | Solve→ |
Design In-Memory File System 61.8% | HardH | Solve→ |
Shortest Bridge 61.8% | MediumM | Solve→ |
Group Anagrams 60.5% | MediumM | Solve→ |
Word Break 60.5% | MediumM | Solve→ |
Meeting Rooms II 60.5% | MediumM | Solve→ |
Rotating the Box 60.5% | MediumM | Solve→ |
Letter Combinations of a Phone Number 59.1% | MediumM | Solve→ |
Top K Frequent Words 59.1% | MediumM | Solve→ |
Cherry Pickup 59.1% | HardH | Solve→ |
Two Sum 57.5% | EasyE | Solve→ |
Serialize and Deserialize Binary Tree 57.5% | HardH | Solve→ |
The Maze 57.5% | MediumM | Solve→ |
Escape the Spreading Fire 57.5% | HardH | Solve→ |
Divide Nodes Into the Maximum Number of Groups 57.5% | HardH | Solve→ |
Minimum Window Substring 55.9% | HardH | Solve→ |
Valid Anagram 55.9% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Shuffle an Array 55.9% | MediumM | Solve→ |
Split Message Based on Limit 55.9% | HardH | Solve→ |
Minimum Operations to Reduce an Integer to 0 55.9% | MediumM | Solve→ |
Merge k Sorted Lists 54.1% | HardH | Solve→ |
Search in Rotated Sorted Array 54.1% | MediumM | Solve→ |
Coin Change 54.1% | MediumM | Solve→ |
Top K Frequent Elements 54.1% | MediumM | Solve→ |
Split Array Largest Sum 54.1% | HardH | Solve→ |
All O`one Data Structure 54.1% | HardH | Solve→ |
Time Based Key-Value Store 54.1% | MediumM | Solve→ |
Minimum Number of Operations to Make Array Continuous 54.1% | HardH | Solve→ |
Minimum Time to Complete Trips 54.1% | MediumM | Solve→ |
Maximize Amount After Two Days of Conversions 54.1% | MediumM | Solve→ |
Maximum Coin Collection 54.1% | MediumM | Solve→ |
The Maze II 54.1% | MediumM | Solve→ |
Roman to Integer 52.1% | EasyE | Solve→ |
Sudoku Solver 52.1% | HardH | Solve→ |
Decode Ways 52.1% | MediumM | Solve→ |
Find Peak Element 52.1% | MediumM | Solve→ |
House Robber III 52.1% | MediumM | Solve→ |
Delete Node in a BST 52.1% | MediumM | Solve→ |
Exclusive Time of Functions 52.1% | MediumM | Solve→ |
Replace Words 52.1% | MediumM | Solve→ |
Asteroid Collision 52.1% | MediumM | Solve→ |
Rotting Oranges 52.1% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Meeting Rooms III 52.1% | HardH | Solve→ |
Find the Number of Ways to Place People II 52.1% | HardH | Solve→ |
Find Minimum Time to Reach Last Room II 52.1% | MediumM | Solve→ |
String to Integer (atoi) 49.9% | MediumM | Solve→ |
Regular Expression Matching 49.9% | HardH | Solve→ |
Generate Parentheses 49.9% | MediumM | Solve→ |
Combination Sum 49.9% | MediumM | Solve→ |
Subsets 49.9% | MediumM | Solve→ |
Copy List with Random Pointer 49.9% | MediumM | Solve→ |
Min Stack 49.9% | MediumM | Solve→ |
Excel Sheet Column Number 49.9% | EasyE | Solve→ |
Binary Tree Right Side View 49.9% | MediumM | Solve→ |
Trips and Users 49.9% | HardH | Solve→ |
Find K Pairs with Smallest Sums 49.9% | MediumM | Solve→ |
Encode and Decode TinyURL 49.9% | MediumM | Solve→ |
Open the Lock 49.9% | MediumM | Solve→ |
Regions Cut By Slashes 49.9% | MediumM | Solve→ |
Merge Strings Alternately 49.9% | EasyE | Solve→ |
Maximum Subarray Min-Product 49.9% | MediumM | Solve→ |
Count Subarrays With Fixed Bounds 49.9% | HardH | Solve→ |
Check if a String Is an Acronym of Words 49.9% | EasyE | Solve→ |
Points That Intersect With Cars 49.9% | EasyE | Solve→ |
Number of Black Blocks 49.9% | MediumM | Solve→ |
Minimum Cost to Equalize Arrays Using Swaps 49.9% | MediumM | Solve→ |
Swap Nodes in Pairs 47.5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Largest Rectangle in Histogram 47.5% | HardH | Solve→ |
Maximum Depth of Binary Tree 47.5% | EasyE | Solve→ |
Valid Palindrome 47.5% | EasyE | Solve→ |
Word Ladder 47.5% | HardH | Solve→ |
Clone Graph 47.5% | MediumM | Solve→ |
Word Break II 47.5% | HardH | Solve→ |
One Edit Distance 47.5% | MediumM | Solve→ |
Reverse Words in a String II 47.5% | MediumM | Solve→ |
Happy Number 47.5% | EasyE | Solve→ |
Reverse Linked List 47.5% | EasyE | Solve→ |
Implement Trie (Prefix Tree) 47.5% | MediumM | Solve→ |
Group Shifted Strings 47.5% | MediumM | Solve→ |
Factor Combinations 47.5% | MediumM | Solve→ |
Palindrome Permutation 47.5% | EasyE | Solve→ |
Word Pattern 47.5% | EasyE | Solve→ |
Word Pattern II 47.5% | MediumM | Solve→ |
Find Median from Data Stream 47.5% | HardH | Solve→ |
Optimal Account Balancing 47.5% | HardH | Solve→ |
Longest Palindromic Subsequence 47.5% | MediumM | Solve→ |
Employee Importance 47.5% | MediumM | Solve→ |
Falling Squares 47.5% | HardH | Solve→ |
Flood Fill 47.5% | EasyE | Solve→ |
Random Pick with Blacklist 47.5% | HardH | Solve→ |
Koko Eating Bananas 47.5% | MediumM | Solve→ |
Fixed Point 47.5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Parallel Courses 47.5% | MediumM | Solve→ |
Minimum Score Triangulation of Polygon 47.5% | MediumM | Solve→ |
Remove Zero Sum Consecutive Nodes from Linked List 47.5% | MediumM | Solve→ |
Find the City With the Smallest Number of Neighbors at a Threshold Distance 47.5% | MediumM | Solve→ |
Find the Distance Value Between Two Arrays 47.5% | EasyE | Solve→ |
Construct K Palindrome Strings 47.5% | MediumM | Solve→ |
Course Schedule IV 47.5% | MediumM | Solve→ |
Number of Nodes in the Sub-Tree With the Same Label 47.5% | MediumM | Solve→ |
Remove Max Number of Edges to Keep Graph Fully Traversable 47.5% | HardH | Solve→ |
Hopper Company Queries I 47.5% | HardH | Solve→ |
Hopper Company Queries II 47.5% | HardH | Solve→ |
Hopper Company Queries III 47.5% | HardH | Solve→ |
Number Of Ways To Reconstruct A Tree 47.5% | HardH | Solve→ |
Maximum Number of Eaten Apples 47.5% | MediumM | Solve→ |
Maximum XOR for Each Query 47.5% | MediumM | Solve→ |
Minimum Absolute Sum Difference 47.5% | MediumM | Solve→ |
Nearest Exit from Entrance in Maze 47.5% | MediumM | Solve→ |
Check for Contradictions in Equations 47.5% | HardH | Solve→ |
Array With Elements Not Equal to Average of Neighbors 47.5% | MediumM | Solve→ |
Check If String Is a Prefix of Array 47.5% | EasyE | Solve→ |
Number of Strings That Appear as Substrings in Word 47.5% | EasyE | Solve→ |
Create Binary Tree From Descriptions 47.5% | MediumM | Solve→ |
Intersection of Multiple Arrays 47.5% | EasyE | Solve→ |
K Divisible Elements Subarrays 47.5% | MediumM | Solve→ |
Calculate Digit Sum of a String 47.5% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Sum of Squared Difference 47.5% | MediumM | Solve→ |
Number of People That Can Be Seen in a Grid 47.5% | MediumM | Solve→ |
Maximize Win From Two Segments 47.5% | MediumM | Solve→ |
Number of Ways to Reach Destination in the Grid 47.5% | HardH | Solve→ |
Find Pattern in Infinite Stream I 47.5% | MediumM | Solve→ |
Minimum Operations to Write the Letter Y on a Grid 47.5% | MediumM | Solve→ |
Find Pattern in Infinite Stream II 47.5% | HardH | Solve→ |
Maximum Increasing Triplet Value 47.5% | MediumM | Solve→ |
Match Alphanumerical Pattern in Matrix I 47.5% | MediumM | Solve→ |
Minimum Operations to Make Binary Array Elements Equal to One I 47.5% | MediumM | Solve→ |
Minimum Operations to Make Binary Array Elements Equal to One II 47.5% | MediumM | Solve→ |
Best Time to Buy and Sell Stock using Strategy 47.5% | MediumM | Solve→ |
Rotate Image 44.8% | MediumM | Solve→ |
Merge Intervals 44.8% | MediumM | Solve→ |
Sliding Window Maximum 44.8% | HardH | Solve→ |
Subarray Sums Divisible by K 44.8% | MediumM | Solve→ |
Boundary of Binary Tree 44.8% | MediumM | Solve→ |
Longest Path With Different Adjacent Characters 44.8% | HardH | Solve→ |
Minimum Cost to Make at Least One Valid Path in a Grid 44.8% | HardH | Solve→ |
Trapping Rain Water 41.6% | HardH | Solve→ |
Longest Consecutive Sequence 41.6% | MediumM | Solve→ |
Candy 41.6% | HardH | Solve→ |
Dungeon Game 41.6% | HardH | Solve→ |
Number of Matching Subsequences 41.6% | MediumM | Solve→ |
Minimum Cost For Tickets 41.6% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Collect Coins in a Tree 41.6% | HardH | Solve→ |
Design Memory Allocator 41.6% | MediumM | Solve→ |
Number of Provinces 41.6% | MediumM | Solve→ |
Basic Calculator II 41.6% | MediumM | Solve→ |
Burst Balloons 41.6% | HardH | Solve→ |
Find the Safest Path in a Grid 41.6% | MediumM | Solve→ |
Longest Palindromic Substring 37.9% | MediumM | Solve→ |
Find First and Last Position of Element in Sorted Array 37.9% | MediumM | Solve→ |
Insert Interval 37.9% | MediumM | Solve→ |
Binary Tree Maximum Path Sum 37.9% | HardH | Solve→ |
House Robber 37.9% | MediumM | Solve→ |
The Skyline Problem 37.9% | HardH | Solve→ |
Reconstruct Itinerary 37.9% | HardH | Solve→ |
LFU Cache 37.9% | HardH | Solve→ |
Task Scheduler 37.9% | MediumM | Solve→ |
Verifying an Alien Dictionary 37.9% | EasyE | Solve→ |
Min Cost to Connect All Points 37.9% | MediumM | Solve→ |
Find All Possible Recipes from Given Supplies 37.9% | MediumM | Solve→ |
Most Profitable Path in a Tree 37.9% | MediumM | Solve→ |
Brightest Position on Street 37.9% | MediumM | Solve→ |
Number of Adjacent Elements With the Same Color 37.9% | MediumM | Solve→ |
24 Game 37.9% | HardH | Solve→ |
Maximum Points You Can Obtain from Cards 37.9% | MediumM | Solve→ |
Maximum Number of Points From Grid Queries 37.9% | HardH | Solve→ |
Minimum Number of Refueling Stops 37.9% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Longest Common Prefix 33.5% | EasyE | Solve→ |
Next Permutation 33.5% | MediumM | Solve→ |
Longest Valid Parentheses 33.5% | HardH | Solve→ |
Permutations 33.5% | MediumM | Solve→ |
Maximum Subarray 33.5% | MediumM | Solve→ |
Minimum Path Sum 33.5% | MediumM | Solve→ |
Shortest Palindrome 33.5% | HardH | Solve→ |
Longest Increasing Path in a Matrix 33.5% | HardH | Solve→ |
Subarray Sum Equals K 33.5% | MediumM | Solve→ |
Sliding Puzzle 33.5% | HardH | Solve→ |
Is Graph Bipartite? 33.5% | MediumM | Solve→ |
Cheapest Flights Within K Stops 33.5% | MediumM | Solve→ |
Exam Room 33.5% | MediumM | Solve→ |
Subarrays with K Different Integers 33.5% | HardH | Solve→ |
Count Nice Pairs in an Array 33.5% | MediumM | Solve→ |
Maximum Earnings From Taxi 33.5% | MediumM | Solve→ |
Word Ladder II 33.5% | HardH | Solve→ |
Add Digits 33.5% | EasyE | Solve→ |
Water and Jug Problem 33.5% | MediumM | Solve→ |
Rotated Digits 33.5% | MediumM | Solve→ |
Detonate the Maximum Bombs 33.5% | MediumM | Solve→ |
Simplify Path 33.5% | MediumM | Solve→ |
Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree 33.5% | HardH | Solve→ |
Replace Non-Coprime Numbers in Array 33.5% | HardH | Solve→ |
Maximum Profit in Job Scheduling 33.5% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximum Number of Events That Can Be Attended 33.5% | MediumM | Solve→ |
Shortest Path to Get All Keys 33.5% | HardH | Solve→ |
Maximum Number of Alloys 33.5% | MediumM | Solve→ |
Median of Two Sorted Arrays 27.8% | HardH | Solve→ |
Remove Element 27.8% | EasyE | Solve→ |
Sqrt(x) 27.8% | EasyE | Solve→ |
Find Minimum in Rotated Sorted Array 27.8% | MediumM | Solve→ |
Move Zeroes 27.8% | EasyE | Solve→ |
Walls and Gates 27.8% | MediumM | Solve→ |
Find Eventual Safe States 27.8% | MediumM | Solve→ |
Capacity To Ship Packages Within D Days 27.8% | MediumM | Solve→ |
Analyze User Website Visit Pattern 27.8% | MediumM | Solve→ |
Minimum Number of Taps to Open to Water a Garden 27.8% | HardH | Solve→ |
Furthest Building You Can Reach 27.8% | MediumM | Solve→ |
Frequency of the Most Frequent Element 27.8% | MediumM | Solve→ |
Number of Flowers in Full Bloom 27.8% | HardH | Solve→ |
Put Marbles in Bags 27.8% | HardH | Solve→ |
Find the Length of the Longest Common Prefix 27.8% | MediumM | Solve→ |
Smallest String With Swaps 27.8% | MediumM | Solve→ |
Design Browser History 27.8% | MediumM | Solve→ |
Design Search Autocomplete System 27.8% | HardH | Solve→ |
Meeting Scheduler 27.8% | MediumM | Solve→ |
Design File System 27.8% | MediumM | Solve→ |
Maximum Frequency Stack 27.8% | HardH | Solve→ |
Design a Text Editor 27.8% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Remove Comments 27.8% | MediumM | Solve→ |
Surrounded Regions 27.8% | MediumM | Solve→ |
Number of Subarrays That Match a Pattern I 27.8% | MediumM | Solve→ |
Add Strings 27.8% | EasyE | Solve→ |
Largest 1-Bordered Square 27.8% | MediumM | Solve→ |
Graph Connectivity With Threshold 27.8% | HardH | Solve→ |
Shortest Path in Binary Matrix 27.8% | MediumM | Solve→ |
Random Point in Non-overlapping Rectangles 27.8% | MediumM | Solve→ |
Accounts Merge 27.8% | MediumM | Solve→ |
Count Primes 27.8% | MediumM | Solve→ |
IPO 27.8% | HardH | Solve→ |
Design A Leaderboard 27.8% | MediumM | Solve→ |
Minimum Jumps to Reach End via Prime Teleportation 27.8% | MediumM | Solve→ |
Minimum Knight Moves 27.8% | MediumM | Solve→ |
Count the Number of Infection Sequences 27.8% | HardH | Solve→ |
Binary Searchable Numbers in an Unsorted Array 27.8% | MediumM | Solve→ |
Number of Ways to Form a Target String Given a Dictionary 27.8% | HardH | Solve→ |
Remove Sub-Folders from the Filesystem 27.8% | MediumM | Solve→ |
Maximize Sum of Weights after Edge Removals 27.8% | HardH | Solve→ |
Add Two Numbers 20.3% | MediumM | Solve→ |
Longest Substring Without Repeating Characters 20.3% | MediumM | Solve→ |
Reverse Integer 20.3% | MediumM | Solve→ |
Container With Most Water 20.3% | MediumM | Solve→ |
Valid Parentheses 20.3% | EasyE | Solve→ |
Remove Duplicates from Sorted Array 20.3% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Kth Largest Element in an Array 20.3% | MediumM | Solve→ |
Search a 2D Matrix II 20.3% | MediumM | Solve→ |
Patching Array 20.3% | HardH | Solve→ |
Matchsticks to Square 20.3% | MediumM | Solve→ |
Predict the Winner 20.3% | MediumM | Solve→ |
Next Greater Element I 20.3% | EasyE | Solve→ |
01 Matrix 20.3% | MediumM | Solve→ |
Find K Closest Elements 20.3% | MediumM | Solve→ |
Candy Crush 20.3% | MediumM | Solve→ |
Swim in Rising Water 20.3% | HardH | Solve→ |
Interval List Intersections 20.3% | MediumM | Solve→ |
Design Parking System 20.3% | EasyE | Solve→ |
Amount of New Area Painted Each Day 20.3% | HardH | Solve→ |
Amount of Time for Binary Tree to Be Infected 20.3% | MediumM | Solve→ |
Count the Number of Good Subarrays 20.3% | MediumM | Solve→ |
Minimum Absolute Difference Between Elements With Constraint 20.3% | MediumM | Solve→ |
Find the Most Competitive Subsequence 20.3% | MediumM | Solve→ |
Get Biggest Three Rhombus Sums in a Grid 20.3% | MediumM | Solve→ |
Meeting Rooms 20.3% | EasyE | Solve→ |
Find the Celebrity 20.3% | MediumM | Solve→ |
Count Different Palindromic Subsequences 20.3% | HardH | Solve→ |
Minimize Malware Spread 20.3% | HardH | Solve→ |
Minimize Malware Spread II 20.3% | HardH | Solve→ |
Count Palindromic Subsequences 20.3% | HardH | Solve→ |
Count Prefix and Suffix Pairs II 20.3% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Number of Distinct Substrings in a String 20.3% | MediumM | Solve→ |
Cache With Time Limit 20.3% | MediumM | Solve→ |
Promise Pool 20.3% | MediumM | Solve→ |
Maximum Manhattan Distance After K Changes 20.3% | MediumM | Solve→ |
Shortest Path in a Grid with Obstacles Elimination 20.3% | HardH | Solve→ |
Valid Palindrome II 20.3% | EasyE | Solve→ |
Maximize Sum Of Array After K Negations 20.3% | EasyE | Solve→ |
Number of Subarrays with Bounded Maximum 20.3% | MediumM | Solve→ |
Design Snake Game 20.3% | MediumM | Solve→ |
Reverse Nodes in k-Group 20.3% | HardH | Solve→ |
Find the Maximum Length of Valid Subsequence II 20.3% | MediumM | Solve→ |
Integer Replacement 20.3% | MediumM | Solve→ |
2 Keys Keyboard 20.3% | MediumM | Solve→ |
Binary Tree Longest Consecutive Sequence II 20.3% | MediumM | Solve→ |
Maximum Average Subarray I 20.3% | EasyE | Solve→ |
Ones and Zeroes 20.3% | MediumM | Solve→ |
Count Integers in Intervals 20.3% | HardH | Solve→ |
Human Traffic of Stadium 20.3% | HardH | Solve→ |
Repeated String Match 20.3% | MediumM | Solve→ |
Insert Delete GetRandom O(1) - Duplicates allowed 20.3% | HardH | Solve→ |
Closest Binary Search Tree Value 20.3% | EasyE | Solve→ |
Minimum Difference in Sums After Removal of Elements 20.3% | HardH | Solve→ |
Linked List Components 20.3% | MediumM | Solve→ |
Count Binary Substrings 20.3% | EasyE | Solve→ |
Bomb Enemy 20.3% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find All People With Secret 20.3% | HardH | Solve→ |
Magnetic Force Between Two Balls 20.3% | MediumM | Solve→ |
Rearranging Fruits 20.3% | HardH | Solve→ |
Process Restricted Friend Requests 20.3% | HardH | Solve→ |
Longest Subsequence With Limited Sum 20.3% | EasyE | Solve→ |
Vertical Order Traversal of a Binary Tree 20.3% | HardH | Solve→ |
Checking Existence of Edge Length Limited Paths 20.3% | HardH | Solve→ |
Find K-th Smallest Pair Distance 20.3% | HardH | Solve→ |
Shortest Distance from All Buildings 20.3% | HardH | Solve→ |
Painting a Grid With Three Different Colors 20.3% | HardH | Solve→ |
Minimize the Maximum Edge Weight of Graph 20.3% | MediumM | Solve→ |
Fizz Buzz 20.3% | EasyE | Solve→ |
Find a Peak Element II 20.3% | MediumM | Solve→ |
Graph Valid Tree 20.3% | MediumM | Solve→ |
Populating Next Right Pointers in Each Node II 20.3% | MediumM | Solve→ |
Minimum Fuel Cost to Report to the Capital 20.3% | MediumM | Solve→ |
Search a 2D Matrix 20.3% | MediumM | Solve→ |
Search Suggestions System 20.3% | MediumM | Solve→ |
Zero Array Transformation II 20.3% | MediumM | Solve→ |
Goat Latin 20.3% | EasyE | Solve→ |
Make Lexicographically Smallest Array by Swapping Elements 20.3% | MediumM | Solve→ |
Number of Wonderful Substrings 20.3% | MediumM | Solve→ |
Sort Colors 20.3% | MediumM | Solve→ |
Design Twitter 20.3% | MediumM | Solve→ |
Reverse Vowels of a String 20.3% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Smallest Number in Infinite Set 20.3% | MediumM | Solve→ |
Last Stone Weight 20.3% | EasyE | Solve→ |
Non-overlapping Intervals 20.3% | MediumM | Solve→ |
Find Duplicate Subtrees 20.3% | MediumM | Solve→ |
Russian Doll Envelopes 20.3% | HardH | Solve→ |
Binary Tree Cameras 20.3% | HardH | Solve→ |
Prime Palindrome 20.3% | MediumM | Solve→ |
Number of Enclaves 20.3% | MediumM | Solve→ |
Sum of Distances in Tree 20.3% | HardH | Solve→ |
Similar Companies
Explore company practice sets with a similar number of tagged coding questions.
Frequently Asked Questions
What LeetCode problems are tagged to Uber?
Our current Uber practice dataset contains 359 tagged coding problems, including Bus Routes, Alien Dictionary, Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit. The difficulty breakdown is 45 Easy, 209 Medium, and 105 Hard problems.
How should I prepare for a Uber coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Uber interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.
What is the difficulty level of Uber coding interviews?
Based on our data, Uber interviews include 45 Easy (13%), 209 Medium (58%), and 105 Hard (29%) problems.
Ready to ace your Uber interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required