77 LeetCode Problems To Crack Uber

Here are 77 LeetCode Problems I will solve to crack my Uber interview.

And no, I won’t “grind 500 problems.”

I will focus on the right ones.

These are the exact problems I will practice right before my Uber interview:

1/ Arrays & Hashing

1. Two Sum

2. Valid Anagram

3. Insert Delete GetRandom O(1)

4. Spiral Matrix

5. Valid Sudoku

6. Group Anagrams

7. Block Placement Queries

2/ Two Pointers

1. Squares of a Sorted Array

2. Happy Number

3. Merge Strings Alternately

4. Valid Palindrome

5. Find the Distance Value Between Two Arrays

6. Rotating the Box

3/ Stack

1. Exclusive Time of Functions

2. Asteroid Collision

3. Min Stack

4. Maximum Subarray Min-Product

5. Largest Rectangle in Histogram

6. Basic Calculator

4/ Binary Search

1. My Calendar I

2. Random Pick with Weight

3. Time Based Key-Value Store

4. Search in Rotated Sorted Array

5. Minimum Time to Complete Trips

6. Escape the Spreading Fire

5/ Sliding Window

1. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit

2. Maximize Win From Two Segments

3. Minimum Operations to Make Binary Array Elements Equal to One I

4. Count Subarrays With Fixed Bounds

5. Minimum Window Substring

6/ Linked List

1. Reverse Linked List

2. LRU Cache

3. Swap Nodes in Pairs

4. Remove Zero Sum Consecutive Nodes from Linked List

5. Copy List with Random Pointer

6. All O`one Data Structure

7/ Trees

1. Maximum Depth of Binary Tree

2. Construct Quad Tree

3. Kth Smallest Element in a BST

4. House Robber III

5. Delete Node in a BST

6. Serialize and Deserialize Binary Tree

8/ Trie

1. Word Break

2. Replace Words

3. Word Search II

9/ Backtracking

1. Word Search

2. Letter Combinations of a Phone Number

3. Subsets

4. Generate Parentheses

5. Sudoku Solver

6. Word Break II

10/ Heap (Priority Queue)

1. Top K Frequent Words

2. Top K Frequent Elements

3. Find K Pairs with Smallest Sums

4. Maximum Number of Eaten Apples

5. Merge k Sorted Lists

6. Meeting Rooms III

11/ Graphs

1. Number of Islands

2. Evaluate Division

3. Course Schedule II

4. Shortest Bridge

5. Course Schedule

6. Bus Routes

12/ Intervals

1. Insert Interval

2. Interval List Intersections

3. Count Integers in Intervals

13/ Greedy & Dynamic Programming

1. Best Time to Buy and Sell Stock

2. Decode Ways

3. Cherry Pickup

4. Text Justification

14/ Prefix Sum

1. Product of Array Except Self

2. Subarray Sums Divisible by K

3. Subarray Sum Equals K

15/ Miscellaneous

1. Shuffle an Array

2. Find the Closest Palindrome

3. Split Message Based on Limit

4. Making A Large Island

If you’re preparing for FAANG in 2026, don’t forget to save this post.

Also, here’s a platform which you can use to practice for your interviews:

🔗 Interview Roadmap Platform: Link

Best of luck!