Uber
336 problems
| Problem | Difficulty | Frequency ↓ | Topics |
|---|---|---|---|
| Match Alphanumerical Pattern in Matrix I | Medium | 49.9% | TopicsArrayHash TableStringMatrix |
| 3191. Minimum Operations to Make Binary Array Elements Equal to One I | Medium | 49.9% | TopicsArrayBit ManipulationQueueSliding WindowPrefix Sum |
| 3192. Minimum Operations to Make Binary Array Elements Equal to One II | Medium | 49.9% | TopicsArrayDynamic ProgrammingGreedy |
| 3652. Best Time to Buy and Sell Stock using Strategy | Medium | 49.9% | TopicsArraySliding WindowPrefix Sum |
| 4001. Aggregate Two Time Series | Medium | 49.9% | TopicsArrayTwo Pointers |
| 84. Largest Rectangle in Histogram | Hard | 47.1% | TopicsArrayStackMonotonic StackRange Minimum/Maximum Query |
| Sliding Window Maximum | Hard | 47.1% | TopicsArrayQueueSliding WindowHeap (Priority Queue)Monotonic QueueRange Minimum/Maximum Query |
| 465. Optimal Account Balancing | Hard | 47.1% | TopicsArrayDynamic ProgrammingBacktrackingBit ManipulationBitmask |
| 2444. Count Subarrays With Fixed Bounds | Hard | 47.1% | TopicsArrayQueueSliding WindowMonotonic Queue |
| 2468. Split Message Based on Limit | Hard | 47.1% | TopicsStringEnumeration |
| Boundary of Binary Tree | Medium | 47.1% | TopicsTreeDepth-First SearchBinary Tree |
| 2246. Longest Path With Different Adjacent Characters | Hard | 47.1% | TopicsArrayStringTreeDepth-First SearchGraph TheoryTopological Sort |
| 1368. Minimum Cost to Make at Least One Valid Path in a Grid | Hard | 47.1% | TopicsArrayBreadth-First SearchGraph TheoryHeap (Priority Queue)MatrixShortest Path0-1 BFSDijkstra's Algorithm |
| 127. Word Ladder | Hard | 43.8% | TopicsHash TableStringBreadth-First SearchBidirectional Search |
| Candy | Hard | 43.8% | TopicsArrayGreedy |
| Dungeon Game | Hard | 43.8% | TopicsArrayDynamic ProgrammingMatrix |
| 332. Reconstruct Itinerary | Hard | 43.8% | TopicsArrayStringDepth-First SearchGraph TheorySortingHeap (Priority Queue)Eulerian CircuitEulerian PathSemi-Eulerian Graph |
| 2603. Collect Coins in a Tree | Hard | 43.8% | TopicsArrayTreeGraph TheoryTopological Sort |
| 3071. Minimum Operations to Write the Letter Y on a Grid | Medium | 43.8% | TopicsArrayHash TableMatrixCounting |
| 2502. Design Memory Allocator | Medium | 43.8% | TopicsArrayHash TableDesignSimulation |
| Number of Provinces | Medium | 43.8% | TopicsDepth-First SearchBreadth-First SearchUnion-FindGraph Theory |
| Basic Calculator II | Medium | 43.8% | TopicsMathStringStack |
| 312. Burst Balloons | Hard | 43.8% | TopicsArrayDynamic Programming |
| 2812. Find the Safest Path in a Grid | Medium | 43.8% | TopicsArrayBinary SearchBreadth-First SearchUnion-FindHeap (Priority Queue)Matrix |
| 871. Minimum Number of Refueling Stops | Hard | 43.8% | TopicsArrayDynamic ProgrammingGreedyHeap (Priority Queue) |
