| OA: Minimum Edge Reversals So All Edges Point Away from a Root | OA | 13× | May 2026 |
| Number of Islands I and II (Union-Find, Lands Added Over Time) | Coding | 12× | September 2026 |
| OA: Jump Game with Prime Steps Ending in 3Free | OA | 11× | August 2026 |
| First Unique Number: Earliest ID Seen Exactly Once in a Stream | Phone Screen | 10× | September 2026 |
| Find Robots Matching Distances to the Nearest BlockersFree | Phone Screen | 9× | October 2026 |
| Design a Parking Lot (OOD): Park, Unpark, Spot TypesFree | Coding | 9× | October 2026 |
| Longest Continuous Subarray with Absolute Difference at Most Limit | Phone Screen | 7× | July 2026 |
| Design a Meeting Scheduler over a Fixed List of Rooms (Book, Cancel) | Coding | 7× | October 2026 |
| Construct a Quad Tree from an Image (Any Values), Then Decode It | Coding | 6× | June 2026 |
| OA: Disk Storage, Count Palindrome-Rearrangeable Paths to the Root | OA | 6× | August 2026 |
| Customer Revenue and Referral Tracking (Lowest K Above a Threshold) | Phone Screen | 5× | April 2026 |
| Design Hit Counter / Expiring Counter Class (put, get_count, get_total_count) | Phone Screen | 5× | July 2026 |
| Kth Smallest / Kth Largest Element in a BST | Phone Screen | 5× | May 2026 |
| Earliest Time All Riders Are Connected (Union-Find, Then Blocks) | Phone Screen | 5× | June 2026 |
| Squares of a Sorted Array, Then the K-th Largest Square | Coding | 5× | September 2026 |
| Meeting Rooms II: Minimum Rooms, Room Assignment, Streaming Intervals | Coding | 5× | October 2026 |
| OA: Maximize Pipeline Throughput Under a Scaling Budget | OA | 5× | June 2026 |
| OA: Minimum Triggers to Absorb All Balls (Chain Attraction) | OA | 5× | June 2026 |
| OA: Balanced Numbers in a Permutation | OA | 5× | May 2026 |
| Word Search (LeetCode 79) and the Straight-Line, 8-Direction Variant | Phone Screen | 4× | July 2026 |
| OA: Final Prices with a Special Discount (Total and Full-Price Indices) | OA | 4× | February 2026 |
| Service / Task Dependency Graph: Cycle Detection, Build Order, Completion Time | Phone Screen | 3× | April 2026 |
| Bus Routes (Fewest Buses from Source to Target) | Phone Screen | 3× | June 2026 |
| Zero Array Transformation (Difference Array over Range Queries) | Coding | 3× | May 2026 |
| Basic Calculator: Evaluate Nested add(a, b) / sub(a, b) Calls | Coding | 3× | May 2026 |
| Rate Limiter: Token Bucket, Thread-Safe Implementation | Coding | 3× | June 2026 |
| Alien Dictionary (Topological Sort) | Coding | 3× | June 2026 |
| Maximum Number of Points from Grid Queries | Coding | 3× | May 2026 |
| Minesweeper: Generate a Grid with N Random Mines, and Reveal on Click | Coding | 3× | August 2026 |
| OA: Purchase Optimization (Max Items from a Start Stall Within Budget) | OA | 3× | February 2026 |
| N-ary Tree: Total Sum, Max Path Sum, and the Max Path Nodes | Phone Screen | 2× | February 2026 |
| Edge Length Limited Paths, Inverted (Every Edge >= k, Offline Union-Find) | Phone Screen | 2× | March 2026 |
| Tournament Bracket: Simulate Rounds by Rank, Then Generate a Valid Seeding | Phone Screen | 2× | May 2026 |
| Serialize and Deserialize a Binary Tree, Then an N-ary Tree | Phone Screen | 2× | October 2026 |
| Build a Directory Tree from Paths, Print It Indented, Find a File's Full Path | Phone Screen | 2× | September 2026 |
| Robot Grid Path with Charging Cells (Fewest Charges, Then Battery, Then Moves) | Phone Screen | 2× | September 2026 |
| Merge Step Functions (Add Two Timelines of Value Changes), Then K of Them | Phone Screen | 2× | April 2026 |
| Leftmost Column with at Least a One | Phone Screen | 2× | June 2026 |
| Open the Lock (Minimum Turns, BFS) | Phone Screen | 2× | May 2026 |
| Letter Combinations of a Phone Number (10-Digit Input) | Coding | 2× | March 2026 |
| Word Search II (Trie + Backtracking) | Coding | 2× | April 2026 |
| Square Root by Binary Search (Integer, Then Floating Point) | Coding | 2× | April 2026 |
| Best Currency Conversion Rate Between Two Currencies | Coding | 2× | August 2026 |
| LRU Cache | Coding | 2× | June 2026 |
| Longest Palindromic Substring (Odd-Length Variant) | Coding | 2× | April 2026 |
| OA: Shortest Subarray with at Least K Distinct Integers | OA | 2× | January 2026 |
| OA: Minimum Knight Moves on an N x N Board | OA | 2× | April 2026 |
| Lowest Common Ancestor of Two Nodes | Phone Screen | 1× | February 2026 |
| Rotting Oranges (Virus Spread on a Grid) | Phone Screen | 1× | February 2026 |
| Best Time to Buy and Sell Stock | Phone Screen | 1× | March 2026 |
| Vertical Order Traversal of a Binary Tree | Phone Screen | 1× | March 2026 |
| Next Greater Palindrome (Closest Palindrome, Greater Only) | Phone Screen | 1× | September 2026 |
| Sort a Matrix into Snake Order Using Adjacent Swaps | Phone Screen | 1× | September 2026 |
| Infected Houses in a Row: Count the Possible Infection Orders | Coding | 1× | April 2026 |
| Repeated Shortest Strictly Increasing Path Queries from the Top-Left | Coding | 1× | September 2026 |
| K Closest Points to a Rider (Heap, Quickselect, Moving Points) | Coding | 1× | August 2026 |
| Cheapest Round-Trip Flight with Departure Before Return | Coding | 1× | August 2026 |
| My Calendar I (Binary Search Booking and Cancellation) | Coding | 1× | November 2025 |
| Binary Tree Longest Consecutive Sequence II | Coding | 1× | February 2026 |
| Time-Based Key-Value Store, Then 1M Requests per Second | Coding | 1× | March 2026 |
| Uber Eats Cart and Pricing Engine (OOD): Customisations, Surge, Promotions, Membership | Coding | 1× | March 2026 |
| OA: Total Cost to Turn Every Substring into a Palindrome | OA | 1× | June 2026 |
| OA: Minimum Operations to Reduce an Integer to 0 (Add or Subtract Powers of 2) | OA | 1× | January 2026 |
| OA: Assign Tasks to Two Workers, the First Does Exactly K, Maximise Reward | OA | 1× | November 2025 |
| OA: Minimum Delivery Cost Between Cities (Unique-Nearest Hop Costs 1) | OA | 1× | July 2026 |