Uber Questions
Here are the LeetCode questions for Uber.
Total: 545
Easy: 79
Medium: 328
Hard: 138
Progress: 0%
Topic Frequency Analysis
All Topics
| Rank | Topic | Frequency | Percentage |
|---|---|---|---|
| 1 | Array | 285 | |
| 2 | String | 154 | |
| 3 | Hash Table | 116 | |
| 4 | Dynamic Programming | 99 | |
| 5 | Math | 82 | |
| 6 | Sorting | 72 | |
| 7 | Depth-First Search | 67 | |
| 8 | Breadth-First Search | 55 | |
| 9 | Matrix | 53 | |
| 10 | Two Pointers | 50 | |
| 11 | Greedy | 47 | |
| 12 | Tree | 45 | |
| 13 | Binary Search | 44 | |
| 14 | Stack | 42 | |
| 15 | Binary Tree | 38 | |
| 16 | Design | 35 | |
| 17 | Heap (Priority Queue) | 34 | |
| 18 | Backtracking | 30 | |
| 19 | Simulation | 30 | |
| 20 | Bit Manipulation | 25 | |
| 21 | Linked List | 20 | |
| 22 | Counting | 20 | |
| 23 | Graph Theory | 19 | |
| 24 | Divide and Conquer | 17 | |
| 25 | Recursion | 17 | |
| 26 | Database | 17 | |
| 27 | Trie | 16 | |
| 28 | Sliding Window | 15 | |
| 29 | Prefix Sum | 15 | |
| 30 | Union-Find | 13 | |
| 31 | Binary Search Tree | 11 | |
| 32 | Queue | 11 | |
| 33 | Monotonic Stack | 10 | |
| 34 | Enumeration | 9 | |
| 35 | Segment Tree | 8 | |
| 36 | Memoization | 7 | |
| 37 | Geometry | 7 | |
| 38 | Hash Function | 7 | |
| 39 | Ordered Set | 7 | |
| 40 | Topological Sort | 6 | |
| 41 | Data Stream | 6 | |
| 42 | Bitmask | 6 | |
| 43 | Interactive | 5 | |
| 44 | Binary Indexed Tree | 4 | |
| 45 | Rolling Hash | 4 | |
| 46 | Combinatorics | 4 | |
| 47 | Doubly-Linked List | 4 | |
| 48 | Iterator | 4 | |
| 49 | Randomized | 4 | |
| 50 | Shortest Path | 4 | |
| 51 | Merge Sort | 3 | |
| 52 | Bucket Sort | 3 | |
| 53 | Number Theory | 3 | |
| 54 | Monotonic Queue | 3 | |
| 55 | Game Theory | 3 | |
| 56 | Brainteaser | 2 | |
| 57 | Sweep Line | 2 | |
| 58 | String Matching | 2 | |
| 59 | Quickselect | 2 | |
| 60 | Counting Sort | 2 | |
| 61 | Probability and Statistics | 2 | |
| 62 | Reservoir Sampling | 1 | |
| 63 | Suffix Array | 1 | |
| 64 | Concurrency | 1 | |
| 65 | Eulerian Circuit | 1 | |
| No. | Question Title | Link | Difficulty | Solved |
|---|---|---|---|---|
| 1 | Minimum Cost to Equalize Arrays Using Swaps | Visit | Medium | |
| 2 | Best Time to Buy and Sell Stock using Strategy | Visit | Medium | |
| 3 | Minimum Jumps to Reach End via Prime Teleportation | Visit | Medium | |
| 4 | Maximum Coin Collection | Visit | Medium | |
| 5 | Maximum Manhattan Distance After K Changes | Visit | Medium | |
| 6 | Restricted | Restricted | Hard | |
| 7 | Restricted | Restricted | Hard | |
| 8 | Restricted | Restricted | Hard | |
| 9 | Restricted | Restricted | Hard | |
| 10 | Restricted | Restricted | Hard | |
| 11 | Restricted | Restricted | Hard | |
| 12 | Restricted | Restricted | Hard | |
| 13 | Restricted | Restricted | Hard | |
| 14 | Restricted | Restricted | Hard | |
| 15 | Restricted | Restricted | Hard |
Log in to access all 545 questions for free!
Log In