All companies
Uber
45 Easy215 Medium102 Hard362 total
| No. | Problem | Difficulty | Frequency |
|---|---|---|---|
| 269 | Alien Dictionary | Hard | |
| 815 | Bus Routes | Hard | |
| 1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | |
| 200 | Number of Islands | Medium | |
| 230 | Kth Smallest Element in a BST | Medium | |
| 305 | Number of Islands II | Hard | |
| 427 | Construct Quad Tree | Medium | |
| 977 | Squares of a Sorted Array | Easy | |
| 1429 | First Unique Number | Medium | |
| 79 | Word Search | Medium | |
| 121 | Best Time to Buy and Sell Stock | Easy | |
| 146 | LRU Cache | Medium | |
| 212 | Word Search II | Hard | |
| 238 | Product of Array Except Self | Medium | |
| 362 | Design Hit Counter | Medium | |
| 380 | Insert Delete GetRandom O(1) | Medium | |
| 399 | Evaluate Division | Medium | |
| 564 | Find the Closest Palindrome | Hard | |
| 729 | My Calendar I | Medium | |
| 528 | Random Pick with Weight | Medium | |
| 1428 | Leftmost Column with at Least a One | Medium | |
| 2858 | Minimum Edge Reversals So Every Node Is Reachable | Hard | |
| 2791 | Count Paths That Can Form a Palindrome in a Tree | Hard | |
| 1 | Two Sum | Easy | |
| 13 | Roman to Integer | Easy | |
| 17 | Letter Combinations of a Phone Number | Medium | |
| 23 | Merge k Sorted Lists | Hard | |
| 33 | Search in Rotated Sorted Array | Medium | |
| 36 | Valid Sudoku | Medium | |
| 49 | Group Anagrams | Medium | |
| 54 | Spiral Matrix | Medium | |
| 68 | Text Justification | Hard | |
| 76 | Minimum Window Substring | Hard | |
| 139 | Word Break | Medium | |
| 207 | Course Schedule | Medium | |
| 210 | Course Schedule II | Medium | |
| 224 | Basic Calculator | Hard | |
| 242 | Valid Anagram | Easy | |
| 253 | Meeting Rooms II | Medium | |
| 297 | Serialize and Deserialize Binary Tree | Hard | |
| 347 | Top K Frequent Elements | Medium | |
| 384 | Shuffle an Array | Medium | |
| 432 | All O`one Data Structure | Hard | |
| 490 | The Maze | Medium | |
| 588 | Design In-Memory File System | Hard | |
| 692 | Top K Frequent Words | Medium | |
| 741 | Cherry Pickup | Hard | |
| 827 | Making A Large Island | Hard | |
| 934 | Shortest Bridge | Medium | |
| 2009 | Minimum Number of Operations to Make Array Continuous | Hard | |
| 2187 | Minimum Time to Complete Trips | Medium | |
| 2258 | Escape the Spreading Fire | Hard | |
| 2468 | Split Message Based on Limit | Hard | |
| 2493 | Divide Nodes Into the Maximum Number of Groups | Hard | |
| 3161 | Block Placement Queries | Hard | |
| 3341 | Find Minimum Time to Reach Last Room I | Medium | |
| 1861 | Rotating the Box | Medium | |
| 1475 | Final Prices With a Special Discount in a Shop | Easy | |
| 1101 | The Earliest Moment When Everyone Become Friends | Medium | |
| 8 | String to Integer (atoi) | Medium | |
| 10 | Regular Expression Matching | Hard | |
| 22 | Generate Parentheses | Medium | |
| 24 | Swap Nodes in Pairs | Medium | |
| 37 | Sudoku Solver | Hard | |
| 39 | Combination Sum | Medium | |
| 78 | Subsets | Medium | |
| 84 | Largest Rectangle in Histogram | Hard | |
| 91 | Decode Ways | Medium | |
| 104 | Maximum Depth of Binary Tree | Easy | |
| 125 | Valid Palindrome | Easy | |
| 127 | Word Ladder | Hard | |
| 133 | Clone Graph | Medium | |
| 138 | Copy List with Random Pointer | Medium | |
| 140 | Word Break II | Hard | |
| 155 | Min Stack | Medium | |
| 161 | One Edit Distance | Medium | |
| 162 | Find Peak Element | Medium | |
| 171 | Excel Sheet Column Number | Easy | |
| 186 | Reverse Words in a String II | Medium | |
| 199 | Binary Tree Right Side View | Medium | |
| 202 | Happy Number | Easy | |
| 206 | Reverse Linked List | Easy | |
| 208 | Implement Trie (Prefix Tree) | Medium | |
| 239 | Sliding Window Maximum | Hard | |
| 249 | Group Shifted Strings | Medium | |
| 254 | Factor Combinations | Medium | |
| 262 | Trips and Users | Hard | |
| 266 | Palindrome Permutation | Easy | |
| 290 | Word Pattern | Easy | |
| 291 | Word Pattern II | Medium | |
| 295 | Find Median from Data Stream | Hard | |
| 322 | Coin Change | Medium | |
| 337 | House Robber III | Medium | |
| 373 | Find K Pairs with Smallest Sums | Medium | |
| 410 | Split Array Largest Sum | Hard | |
| 450 | Delete Node in a BST | Medium | |
| 465 | Optimal Account Balancing | Hard | |
| 516 | Longest Palindromic Subsequence | Medium | |
| 535 | Encode and Decode TinyURL | Medium | |
| 636 | Exclusive Time of Functions | Medium | |
| 648 | Replace Words | Medium | |
| 690 | Employee Importance | Medium | |
| 699 | Falling Squares | Hard | |
| 733 | Flood Fill | Easy | |
| 735 | Asteroid Collision | Medium | |
| 752 | Open the Lock | Medium | |
| 710 | Random Pick with Blacklist | Hard | |
| 875 | Koko Eating Bananas | Medium | |
| 959 | Regions Cut By Slashes | Medium | |
| 981 | Time Based Key-Value Store | Medium | |
| 994 | Rotting Oranges | Medium | |
| 1064 | Fixed Point | Easy | |
| 1136 | Parallel Courses | Medium | |
| 1039 | Minimum Score Triangulation of Polygon | Medium | |
| 1171 | Remove Zero Sum Consecutive Nodes from Linked List | Medium | |
| 1334 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium | |
| 1385 | Find the Distance Value Between Two Arrays | Easy | |
| 1400 | Construct K Palindrome Strings | Medium | |
| 1462 | Course Schedule IV | Medium | |
| 1519 | Number of Nodes in the Sub-Tree With the Same Label | Medium | |
| 1579 | Remove Max Number of Edges to Keep Graph Fully Traversable | Hard | |
| 1635 | Hopper Company Queries I | Hard | |
| 1645 | Hopper Company Queries II | Hard | |
| 1651 | Hopper Company Queries III | Hard | |
| 1719 | Number Of Ways To Reconstruct A Tree | Hard | |
| 1705 | Maximum Number of Eaten Apples | Medium | |
| 1768 | Merge Strings Alternately | Easy | |
| 1829 | Maximum XOR for Each Query | Medium | |
| 1818 | Minimum Absolute Sum Difference | Medium | |
| 1856 | Maximum Subarray Min-Product | Medium | |
| 1926 | Nearest Exit from Entrance in Maze | Medium | |
| 2307 | Check for Contradictions in Equations | Hard | |
| 1968 | Array With Elements Not Equal to Average of Neighbors | Medium | |
| 1961 | Check If String Is a Prefix of Array | Easy | |
| 1967 | Number of Strings That Appear as Substrings in Word | Easy | |
| 2196 | Create Binary Tree From Descriptions | Medium | |
| 2248 | Intersection of Multiple Arrays | Easy | |
| 2261 | K Divisible Elements Subarrays | Medium | |
| 2243 | Calculate Digit Sum of a String | Easy | |
| 2333 | Minimum Sum of Squared Difference | Medium | |
| 2282 | Number of People That Can Be Seen in a Grid | Medium | |
| 2402 | Meeting Rooms III | Hard | |
| 2444 | Count Subarrays With Fixed Bounds | Hard | |
| 2555 | Maximize Win From Two Segments | Medium | |
| 2828 | Check if a String Is an Acronym of Words | Easy | |
| 2848 | Points That Intersect With Cars | Easy | |
| 2912 | Number of Ways to Reach Destination in the Grid | Hard | |
| 3023 | Find Pattern in Infinite Stream I | Medium | |
| 3071 | Minimum Operations to Write the Letter Y on a Grid | Medium | |
| 3037 | Find Pattern in Infinite Stream II | Hard | |
| 3073 | Maximum Increasing Triplet Value | Medium | |
| 3078 | Match Alphanumerical Pattern in Matrix I | Medium | |
| 3191 | Minimum Operations to Make Binary Array Elements Equal to One I | Medium | |
| 3192 | Minimum Operations to Make Binary Array Elements Equal to One II | Medium | |
| 3027 | Find the Number of Ways to Place People II | Hard | |
| 3342 | Find Minimum Time to Reach Last Room II | Medium | |
| 3387 | Maximize Amount After Two Days of Conversions | Medium | |
| 2768 | Number of Black Blocks | Medium | |
| 3466 | Maximum Coin Collection | Medium | |
| 505 | The Maze II | Medium | |
| 3652 | Best Time to Buy and Sell Stock using Strategy | Medium | |
| 2571 | Minimum Operations to Reduce an Integer to 0 | Medium | |
| 3868 | Minimum Cost to Equalize Arrays Using Swaps | Medium | |
| 5 | Longest Palindromic Substring | Medium | |
| 14 | Longest Common Prefix | Easy | |
| 31 | Next Permutation | Medium | |
| 32 | Longest Valid Parentheses | Hard | |
| 34 | Find First and Last Position of Element in Sorted Array | Medium | |
| 42 | Trapping Rain Water | Hard | |
| 46 | Permutations | Medium | |
| 48 | Rotate Image | Medium | |
| 53 | Maximum Subarray | Medium | |
| 56 | Merge Intervals | Medium | |
| 57 | Insert Interval | Medium | |
| 64 | Minimum Path Sum | Medium | |
| 124 | Binary Tree Maximum Path Sum | Hard | |
| 128 | Longest Consecutive Sequence | Medium | |
| 135 | Candy | Hard | |
| 153 | Find Minimum in Rotated Sorted Array | Medium | |
| 174 | Dungeon Game | Hard | |
| 198 | House Robber | Medium | |
| 214 | Shortest Palindrome | Hard | |
| 218 | The Skyline Problem | Hard | |
| 283 | Move Zeroes | Easy | |
| 286 | Walls and Gates | Medium | |
| 329 | Longest Increasing Path in a Matrix | Hard | |
| 332 | Reconstruct Itinerary | Hard | |
| 460 | LFU Cache | Hard | |
| 560 | Subarray Sum Equals K | Medium | |
| 621 | Task Scheduler | Medium | |
| 773 | Sliding Puzzle | Hard | |
| 785 | Is Graph Bipartite? | Medium | |
| 787 | Cheapest Flights Within K Stops | Medium | |
| 792 | Number of Matching Subsequences | Medium | |
| 855 | Exam Room | Medium | |
| 953 | Verifying an Alien Dictionary | Easy | |
| 983 | Minimum Cost For Tickets | Medium | |
| 992 | Subarrays with K Different Integers | Hard | |
| 1584 | Min Cost to Connect All Points | Medium | |
| 1814 | Count Nice Pairs in an Array | Medium | |
| 2008 | Maximum Earnings From Taxi | Medium | |
| 2115 | Find All Possible Recipes from Given Supplies | Medium | |
| 2251 | Number of Flowers in Full Bloom | Hard | |
| 2603 | Collect Coins in a Tree | Hard | |
| 1202 | Smallest String With Swaps | Medium | |
| 126 | Word Ladder II | Hard | |
| 974 | Subarray Sums Divisible by K | Medium | |
| 258 | Add Digits | Easy | |
| 545 | Boundary of Binary Tree | Medium | |
| 2502 | Design Memory Allocator | Medium | |
| 2246 | Longest Path With Different Adjacent Characters | Hard | |
| 365 | Water and Jug Problem | Medium | |
| 2467 | Most Profitable Path in a Tree | Medium | |
| 2021 | Brightest Position on Street | Medium | |
| 788 | Rotated Digits | Medium | |
| 2672 | Number of Adjacent Elements With the Same Color | Medium | |
| 547 | Number of Provinces | Medium | |
| 227 | Basic Calculator II | Medium | |
| 679 | 24 Game | Hard | |
| 2101 | Detonate the Maximum Bombs | Medium | |
| 1423 | Maximum Points You Can Obtain from Cards | Medium | |
| 312 | Burst Balloons | Hard | |
| 1368 | Minimum Cost to Make at Least One Valid Path in a Grid | Hard | |
| 1489 | Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree | Hard | |
| 2197 | Replace Non-Coprime Numbers in Array | Hard | |
| 1235 | Maximum Profit in Job Scheduling | Hard | |
| 1353 | Maximum Number of Events That Can Be Attended | Medium | |
| 2812 | Find the Safest Path in a Grid | Medium | |
| 2503 | Maximum Number of Points From Grid Queries | Hard | |
| 864 | Shortest Path to Get All Keys | Hard | |
| 2861 | Maximum Number of Alloys | Medium | |
| 2 | Add Two Numbers | Medium | |
| 3 | Longest Substring Without Repeating Characters | Medium | |
| 4 | Median of Two Sorted Arrays | Hard | |
| 7 | Reverse Integer | Medium | |
| 11 | Container With Most Water | Medium | |
| 20 | Valid Parentheses | Easy | |
| 26 | Remove Duplicates from Sorted Array | Easy | |
| 27 | Remove Element | Easy | |
| 69 | Sqrt(x) | Easy | |
| 70 | Climbing Stairs | Easy | |
| 73 | Set Matrix Zeroes | Medium | |
| 215 | Kth Largest Element in an Array | Medium | |
| 240 | Search a 2D Matrix II | Medium | |
| 300 | Longest Increasing Subsequence | Medium | |
| 330 | Patching Array | Hard | |
| 424 | Longest Repeating Character Replacement | Medium | |
| 473 | Matchsticks to Square | Medium | |
| 486 | Predict the Winner | Medium | |
| 496 | Next Greater Element I | Easy | |
| 514 | Freedom Trail | Hard | |
| 542 | 01 Matrix | Medium | |
| 658 | Find K Closest Elements | Medium | |
| 723 | Candy Crush | Medium | |
| 778 | Swim in Rising Water | Hard | |
| 802 | Find Eventual Safe States | Medium | |
| 886 | Possible Bipartition | Medium | |
| 986 | Interval List Intersections | Medium | |
| 1011 | Capacity To Ship Packages Within D Days | Medium | |
| 1152 | Analyze User Website Visit Pattern | Medium | |
| 1140 | Stone Game II | Medium | |
| 1326 | Minimum Number of Taps to Open to Water a Garden | Hard | |
| 1603 | Design Parking System | Easy | |
| 1642 | Furthest Building You Can Reach | Medium | |
| 1838 | Frequency of the Most Frequent Element | Medium | |
| 2043 | Simple Bank System | Medium | |
| 2158 | Amount of New Area Painted Each Day | Hard | |
| 2385 | Amount of Time for Binary Tree to Be Infected | Medium | |
| 2537 | Count the Number of Good Subarrays | Medium | |
| 2551 | Put Marbles in Bags | Hard | |
| 3043 | Find the Length of the Longest Common Prefix | Medium | |
| 213 | House Robber II | Medium | |
| 2817 | Minimum Absolute Difference Between Elements With Constraint | Medium | |
| 256 | Paint House | Medium | |
| 1673 | Find the Most Competitive Subsequence | Medium | |
| 1472 | Design Browser History | Medium | |
| 1878 | Get Biggest Three Rhombus Sums in a Grid | Medium | |
| 252 | Meeting Rooms | Easy | |
| 642 | Design Search Autocomplete System | Hard | |
| 1229 | Meeting Scheduler | Medium | |
| 1166 | Design File System | Medium | |
| 895 | Maximum Frequency Stack | Hard | |
| 277 | Find the Celebrity | Medium | |
| 730 | Count Different Palindromic Subsequences | Hard | |
| 885 | Spiral Matrix III | Medium | |
| 2296 | Design a Text Editor | Hard | |
| 722 | Remove Comments | Medium | |
| 924 | Minimize Malware Spread | Hard | |
| 928 | Minimize Malware Spread II | Hard | |
| 130 | Surrounded Regions | Medium | |
| 2484 | Count Palindromic Subsequences | Hard | |
| 3045 | Count Prefix and Suffix Pairs II | Hard | |
| 1698 | Number of Distinct Substrings in a String | Medium | |
| 3034 | Number of Subarrays That Match a Pattern I | Medium | |
| 2622 | Cache With Time Limit | Medium | |
| 415 | Add Strings | Easy | |
| 2636 | Promise Pool | Medium | |
| 3443 | Maximum Manhattan Distance After K Changes | Medium | |
| 1293 | Shortest Path in a Grid with Obstacles Elimination | Hard | |
| 680 | Valid Palindrome II | Easy | |
| 1005 | Maximize Sum Of Array After K Negations | Easy | |
| 1139 | Largest 1-Bordered Square | Medium | |
| 795 | Number of Subarrays with Bounded Maximum | Medium | |
| 1627 | Graph Connectivity With Threshold | Hard | |
| 353 | Design Snake Game | Medium | |
| 71 | Simplify Path | Medium | |
| 1091 | Shortest Path in Binary Matrix | Medium | |
| 497 | Random Point in Non-overlapping Rectangles | Medium | |
| 25 | Reverse Nodes in k-Group | Hard | |
| 3202 | Find the Maximum Length of Valid Subsequence II | Medium | |
| 397 | Integer Replacement | Medium | |
| 650 | 2 Keys Keyboard | Medium | |
| 549 | Binary Tree Longest Consecutive Sequence II | Medium | |
| 643 | Maximum Average Subarray I | Easy | |
| 474 | Ones and Zeroes | Medium | |
| 2276 | Count Integers in Intervals | Hard | |
| 601 | Human Traffic of Stadium | Hard | |
| 686 | Repeated String Match | Medium | |
| 381 | Insert Delete GetRandom O(1) - Duplicates allowed | Hard | |
| 270 | Closest Binary Search Tree Value | Easy | |
| 721 | Accounts Merge | Medium | |
| 2163 | Minimum Difference in Sums After Removal of Elements | Hard | |
| 204 | Count Primes | Medium | |
| 817 | Linked List Components | Medium | |
| 696 | Count Binary Substrings | Easy | |
| 361 | Bomb Enemy | Medium | |
| 2092 | Find All People With Secret | Hard | |
| 1552 | Magnetic Force Between Two Balls | Medium | |
| 2561 | Rearranging Fruits | Hard | |
| 502 | IPO | Hard | |
| 1244 | Design A Leaderboard | Medium | |
| 3629 | Minimum Jumps to Reach End via Prime Teleportation | Medium | |
| 2076 | Process Restricted Friend Requests | Hard | |
| 1197 | Minimum Knight Moves | Medium | |
| 2389 | Longest Subsequence With Limited Sum | Easy | |
| 987 | Vertical Order Traversal of a Binary Tree | Hard | |
| 1697 | Checking Existence of Edge Length Limited Paths | Hard | |
| 719 | Find K-th Smallest Pair Distance | Hard | |
| 317 | Shortest Distance from All Buildings | Hard | |
| 1931 | Painting a Grid With Three Different Colors | Hard | |
| 438 | Find All Anagrams in a String | Medium | |
| 3419 | Minimize the Maximum Edge Weight of Graph | Medium | |
| 412 | Fizz Buzz | Easy | |
| 2954 | Count the Number of Infection Sequences | Hard | |
| 1901 | Find a Peak Element II | Medium | |
| 1966 | Binary Searchable Numbers in an Unsorted Array | Medium | |
| 261 | Graph Valid Tree | Medium | |
| 117 | Populating Next Right Pointers in Each Node II | Medium | |
| 2477 | Minimum Fuel Cost to Report to the Capital | Medium | |
| 1639 | Number of Ways to Form a Target String Given a Dictionary | Hard | |
| 74 | Search a 2D Matrix | Medium | |
| 1268 | Search Suggestions System | Medium | |
| 3356 | Zero Array Transformation II | Medium | |
| 1233 | Remove Sub-Folders from the Filesystem | Medium | |
| 824 | Goat Latin | Easy | |
| 2948 | Make Lexicographically Smallest Array by Swapping Elements | Medium | |
| 1915 | Number of Wonderful Substrings | Medium | |
| 871 | Minimum Number of Refueling Stops | Hard | |
| 75 | Sort Colors | Medium | |
| 355 | Design Twitter | Medium | |
| 345 | Reverse Vowels of a String | Easy | |
| 2336 | Smallest Number in Infinite Set | Medium |