Uber Questions
Here are the LeetCode questions for Uber.
Total: 524
Easy: 77
Medium: 315
Hard: 132
Progress: 0%
Topic Frequency Analysis
All Topics
| Rank | Topic | Frequency | Percentage |
|---|---|---|---|
| 1 | Array | 274 | |
| 2 | String | 148 | |
| 3 | Hash Table | 110 | |
| 4 | Dynamic Programming | 98 | |
| 5 | Math | 79 | |
| 6 | Sorting | 68 | |
| 7 | Depth-First Search | 64 | |
| 8 | Breadth-First Search | 52 | |
| 9 | Matrix | 52 | |
| 10 | Two Pointers | 49 | |
| 11 | Greedy | 44 | |
| 12 | Tree | 44 | |
| 13 | Binary Search | 40 | |
| 14 | Stack | 40 | |
| 15 | Binary Tree | 37 | |
| 16 | Design | 34 | |
| 17 | Heap (Priority Queue) | 34 | |
| 18 | Backtracking | 30 | |
| 19 | Simulation | 27 | |
| 20 | Bit Manipulation | 25 | |
| 21 | Counting | 19 | |
| 22 | Linked List | 18 | |
| 23 | Graph Theory | 18 | |
| 24 | Divide and Conquer | 16 | |
| 25 | Recursion | 16 | |
| 26 | Trie | 15 | |
| 27 | Database | 15 | |
| 28 | Prefix Sum | 13 | |
| 29 | Union-Find | 12 | |
| 30 | Sliding Window | 12 | |
| 31 | Binary Search Tree | 11 | |
| 32 | Queue | 10 | |
| 33 | Monotonic Stack | 10 | |
| 34 | Segment Tree | 8 | |
| 35 | Enumeration | 8 | |
| 36 | Memoization | 7 | |
| 37 | Ordered Set | 7 | |
| 38 | Topological Sort | 6 | |
| 39 | Geometry | 6 | |
| 40 | Data Stream | 6 | |
| 41 | Hash Function | 6 | |
| 42 | Bitmask | 6 | |
| 43 | Binary Indexed Tree | 4 | |
| 44 | Iterator | 4 | |
| 45 | Randomized | 4 | |
| 46 | Shortest Path | 4 | |
| 47 | Rolling Hash | 3 | |
| 48 | Merge Sort | 3 | |
| 49 | Combinatorics | 3 | |
| 50 | Doubly-Linked List | 3 | |
| 51 | Interactive | 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 | Best Time to Buy and Sell Stock using Strategy | Visit | Medium | |
| 2 | Minimum Jumps to Reach End via Prime Teleportation | Visit | Medium | |
| 3 | Maximum Coin Collection | Visit | Medium | |
| 4 | Maximum Manhattan Distance After K Changes | Visit | Medium | |
| 5 | Maximize Amount After Two Days of Conversions | 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 524 questions for free!
Log In