DSA Doctor
Verified Company Vault
30d Active
Uber DSA Interview Questions
366 curated coding interview questions directly asked in Uber technical rounds, sorted by frequency with recency and difficulty diagnostics.
366
Total Questions
45 (12%)
Easy Problems
216 (59%)
Medium Problems
105 (29%)
Hard Problems
🔥 Most Tested Topics:
Core DSA (128)Arrays (106)Strings (55)Trees (37)Graphs (17)
📂 Sourced Datasets:
Last 30 daysLast 3 monthsLast 6 monthsAll questionsOlder than 6 months
Showing top 200 of 366 questions. View all 366 in the interactive tracker.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 305 | Number of Islands II | Hard | Graphs | BFS / DFS / Topological Sort | 40.6% | 100.0% | 30d |
| 2791 | Count Paths That Can Form a Palindrome in a Tree | Hard | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 52.2% | 100.0% | 3m |
| 427 | Construct Quad Tree | Medium | Trees | DFS / BFS | 78.3% | 87.5% | 30d |
| 1101 | The Earliest Moment When Everyone Become Friends | Medium | Core DSA | Implementation / Reasoning | 66.1% | 87.5% | 30d |
| 1429 | First Unique Number | Medium | Core DSA | Implementation / Reasoning | 57.6% | 87.5% | 30d |
| 977 | Squares of a Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 73.8% | 87.5% | 30d |
| 2858 | Minimum Edge Reversals So Every Node Is Reachable | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 59.5% | 87.5% | 30d |
| 269 | Alien Dictionary | Hard | Graphs | BFS / DFS / Topological Sort | 37.2% | 87.5% | 3m |
| 1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | Arrays | Sorting / Prefix / Scan | 57.7% | 75.0% | 30d |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 75.0% | 30d |
| 230 | Kth Smallest Element in a BST | Medium | Trees; Heap | DFS / BFS; Priority Queue | 76.8% | 75.0% | 30d |
| 79 | Word Search | Medium | Strings; Binary Search | Hashing / Sliding Window; Binary Search | 47.4% | 75.0% | 30d |
| 1475 | Final Prices With a Special Discount in a Shop | Easy | Core DSA | Implementation / Reasoning | 84.1% | 75.0% | 30d |
| 815 | Bus Routes | Hard | Core DSA | Implementation / Reasoning | 47.3% | 75.0% | 30d |
| 564 | Find the Closest Palindrome | Hard | Strings | Hashing / Sliding Window | 32.0% | 75.0% | 30d |
| 2503 | Maximum Number of Points From Grid Queries | Hard | Arrays | Sorting / Prefix / Scan | 59.3% | 75.0% | 30d |
| 981 | Time Based Key-Value Store | Medium | Core DSA | Implementation / Reasoning | 49.9% | 75.0% | 3m |
| 162 | Find Peak Element | Medium | Binary Search | Binary Search | 47.0% | 75.0% | 3m |
| 855 | Exam Room | Medium | Core DSA | Implementation / Reasoning | 43.5% | 75.0% | 3m |
| 68 | Text Justification | Hard | Core DSA | Implementation / Reasoning | 51.2% | 75.0% | all |
| 238 | Product of Array Except Self | Medium | Arrays | Sorting / Prefix / Scan | 68.9% | 75.0% | all |
| 729 | My Calendar I | Medium | Core DSA | Implementation / Reasoning | 58.3% | 75.0% | all |
| 528 | Random Pick with Weight | Medium | Core DSA | Implementation / Reasoning | 49.1% | 75.0% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 62.5% | 3m |
| 2571 | Minimum Operations to Reduce an Integer to 0 | Medium | Arrays | Sorting / Prefix / Scan | 62.4% | 62.5% | 3m |
| 362 | Design Hit Counter | Medium | Design | Data Structure Design | 69.7% | 62.5% | 3m |
| 1428 | Leftmost Column with at Least a One | Medium | Core DSA | Implementation / Reasoning | 55.2% | 62.5% | 3m |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 62.5% | 3m |
| 2861 | Maximum Number of Alloys | Medium | Arrays | Sorting / Prefix / Scan | 41.0% | 62.5% | 3m |
| 380 | Insert Delete GetRandom O(1) | Medium | Core DSA | Implementation / Reasoning | 55.4% | 62.5% | 3m |
| 210 | Course Schedule II | Medium | Graphs | BFS / DFS / Topological Sort | 55.5% | 62.5% | 3m |
| 2954 | Count the Number of Infection Sequences | Hard | Core DSA | Implementation / Reasoning | 37.8% | 62.5% | 3m |
| 207 | Course Schedule | Medium | Graphs | BFS / DFS / Topological Sort | 51.4% | 62.5% | 6m |
| 827 | Making A Large Island | Hard | Graphs | BFS / DFS / Topological Sort | 56.6% | 62.5% | 6m |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 62.5% | all |
| 17 | Letter Combinations of a Phone Number | Medium | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 66.1% | 62.5% | all |
| 23 | Merge k Sorted Lists | Hard | Arrays; Linked List; Heap | Sorting / Prefix / Scan; Two Pointers; Priority Queue | 59.6% | 62.5% | all |
| 36 | Valid Sudoku | Medium | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 64.5% | 62.5% | all |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 62.5% | all |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 62.5% | all |
| 76 | Minimum Window Substring | Hard | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS; Sliding Window | 47.5% | 62.5% | all |
| 224 | Basic Calculator | Hard | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 62.5% | all |
| 242 | Valid Anagram | Easy | Strings | Hashing / Sliding Window | 68.1% | 62.5% | all |
| 297 | Serialize and Deserialize Binary Tree | Hard | Trees; Design | DFS / BFS; Data Structure Design | 60.8% | 62.5% | all |
| 588 | Design In-Memory File System | Hard | Design | Data Structure Design | 48.4% | 62.5% | all |
| 741 | Cherry Pickup | Hard | Core DSA | Implementation / Reasoning | 39.5% | 62.5% | all |
| 2009 | Minimum Number of Operations to Make Array Continuous | Hard | Arrays | Sorting / Prefix / Scan | 51.8% | 62.5% | all |
| 2258 | Escape the Spreading Fire | Hard | Core DSA | Implementation / Reasoning | 38.2% | 62.5% | all |
| 2444 | Count Subarrays With Fixed Bounds | Hard | Arrays | Sorting / Prefix / Scan | 69.2% | 62.5% | all |
| 2468 | Split Message Based on Limit | Hard | Core DSA | Implementation / Reasoning | 42.1% | 62.5% | all |
| 2493 | Divide Nodes Into the Maximum Number of Groups | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 66.9% | 62.5% | all |
| 3071 | Minimum Operations to Write the Letter Y on a Grid | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 64.6% | 62.5% | all |
| 3161 | Block Placement Queries | Hard | Core DSA | Implementation / Reasoning | 18.7% | 62.5% | all |
| 3341 | Find Minimum Time to Reach Last Room I | Medium | Arrays | Sorting / Prefix / Scan | 55.4% | 62.5% | all |
| 1861 | Rotating the Box | Medium | Core DSA | Implementation / Reasoning | 82.5% | 62.5% | all |
| 410 | Split Array Largest Sum | Hard | Arrays | Sorting / Prefix / Scan | 60.4% | 50.0% | 3m |
| 864 | Shortest Path to Get All Keys | Hard | Core DSA | Implementation / Reasoning | 54.6% | 50.0% | 3m |
| 679 | 24 Game | Hard | Core DSA | Implementation / Reasoning | 59.5% | 50.0% | 3m |
| 2389 | Longest Subsequence With Limited Sum | Easy | Arrays | Sorting / Prefix / Scan | 73.6% | 50.0% | 3m |
| 987 | Vertical Order Traversal of a Binary Tree | Hard | Trees | DFS / BFS | 53.8% | 50.0% | 3m |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 50.0% | 3m |
| 2402 | Meeting Rooms III | Hard | Greedy | Greedy | 51.5% | 50.0% | 3m |
| 1931 | Painting a Grid With Three Different Colors | Hard | Core DSA | Implementation / Reasoning | 77.1% | 50.0% | 3m |
| 1197 | Minimum Knight Moves | Medium | Arrays | Sorting / Prefix / Scan | 42.0% | 50.0% | 3m |
| 384 | Shuffle an Array | Medium | Arrays | Sorting / Prefix / Scan | 59.7% | 50.0% | 3m |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 50.0% | 3m |
| 2477 | Minimum Fuel Cost to Report to the Capital | Medium | Arrays | Sorting / Prefix / Scan | 65.3% | 50.0% | 3m |
| 295 | Find Median from Data Stream | Hard | Heap | Priority Queue | 54.5% | 50.0% | 3m |
| 802 | Find Eventual Safe States | Medium | Core DSA | Implementation / Reasoning | 70.7% | 50.0% | 3m |
| 212 | Word Search II | Hard | Strings; Binary Search | Hashing / Sliding Window; Binary Search | 38.5% | 50.0% | 3m |
| 399 | Evaluate Division | Medium | Core DSA | Implementation / Reasoning | 64.2% | 50.0% | 3m |
| 934 | Shortest Bridge | Medium | Core DSA | Implementation / Reasoning | 59.5% | 50.0% | 6m |
| 253 | Meeting Rooms II | Medium | Greedy | Greedy | 52.7% | 50.0% | 6m |
| 139 | Word Break | Medium | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 49.5% | 50.0% | 6m |
| 204 | Count Primes | Medium | Core DSA | Implementation / Reasoning | 36.1% | 50.0% | 6m |
| 787 | Cheapest Flights Within K Stops | Medium | Heap | Priority Queue | 41.8% | 50.0% | 6m |
| 502 | IPO | Hard | Core DSA | Implementation / Reasoning | 53.5% | 50.0% | 6m |
| 3629 | Minimum Jumps to Reach End via Prime Teleportation | Medium | Arrays; Greedy | Sorting / Prefix / Scan; Greedy | 44.8% | 50.0% | 6m |
| 8 | String to Integer (atoi) | Medium | Strings | Hashing / Sliding Window | 21.0% | 50.0% | all |
| 10 | Regular Expression Matching | Hard | Core DSA | Implementation / Reasoning | 31.0% | 50.0% | all |
| 13 | Roman to Integer | Easy | Strings | Hashing / Sliding Window | 66.6% | 50.0% | all |
| 22 | Generate Parentheses | Medium | Strings | Hashing / Sliding Window | 78.7% | 50.0% | all |
| 24 | Swap Nodes in Pairs | Medium | Trees | DFS / BFS | 69.5% | 50.0% | all |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 50.0% | all |
| 37 | Sudoku Solver | Hard | Backtracking | Backtracking | 65.5% | 50.0% | all |
| 39 | Combination Sum | Medium | Arrays; Backtracking | Sorting / Prefix / Scan; Backtracking | 76.5% | 50.0% | all |
| 78 | Subsets | Medium | Backtracking | Backtracking | 82.3% | 50.0% | all |
| 84 | Largest Rectangle in Histogram | Hard | Core DSA | Implementation / Reasoning | 49.9% | 50.0% | all |
| 91 | Decode Ways | Medium | Dynamic Programming | State Transition | 38.0% | 50.0% | all |
| 104 | Maximum Depth of Binary Tree | Easy | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 78.2% | 50.0% | all |
| 125 | Valid Palindrome | Easy | Strings | Hashing / Sliding Window | 53.3% | 50.0% | all |
| 133 | Clone Graph | Medium | Graphs | BFS / DFS / Topological Sort | 65.3% | 50.0% | all |
| 138 | Copy List with Random Pointer | Medium | Linked List | Two Pointers | 62.9% | 50.0% | all |
| 140 | Word Break II | Hard | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 55.6% | 50.0% | all |
| 155 | Min Stack | Medium | Stack / Queue | Monotonic Stack / Simulation | 58.2% | 50.0% | all |
| 161 | One Edit Distance | Medium | Dynamic Programming | State Transition | 34.6% | 50.0% | all |
| 171 | Excel Sheet Column Number | Easy | Core DSA | Implementation / Reasoning | 67.8% | 50.0% | all |
| 186 | Reverse Words in a String II | Medium | Strings | Hashing / Sliding Window | 56.7% | 50.0% | all |
| 199 | Binary Tree Right Side View | Medium | Trees | DFS / BFS | 70.2% | 50.0% | all |
| 202 | Happy Number | Easy | Core DSA | Implementation / Reasoning | 59.7% | 50.0% | all |
| 206 | Reverse Linked List | Easy | Linked List | Two Pointers | 80.6% | 50.0% | all |
| 208 | Implement Trie (Prefix Tree) | Medium | Trees | DFS / BFS | 69.5% | 50.0% | all |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 50.0% | all |
| 249 | Group Shifted Strings | Medium | Strings | Hashing / Sliding Window | 67.8% | 50.0% | all |
| 254 | Factor Combinations | Medium | Backtracking | Backtracking | 50.5% | 50.0% | all |
| 262 | Trips and Users | Hard | Core DSA | Implementation / Reasoning | 38.3% | 50.0% | all |
| 266 | Palindrome Permutation | Easy | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 68.7% | 50.0% | all |
| 290 | Word Pattern | Easy | Strings | Hashing / Sliding Window | 44.1% | 50.0% | all |
| 291 | Word Pattern II | Medium | Strings | Hashing / Sliding Window | 48.8% | 50.0% | all |
| 322 | Coin Change | Medium | Dynamic Programming | State Transition | 48.4% | 50.0% | all |
| 337 | House Robber III | Medium | Dynamic Programming | State Transition | 55.9% | 50.0% | all |
| 373 | Find K Pairs with Smallest Sums | Medium | Arrays | Sorting / Prefix / Scan | 41.9% | 50.0% | all |
| 432 | All O`one Data Structure | Hard | Core DSA | Implementation / Reasoning | 44.3% | 50.0% | all |
| 450 | Delete Node in a BST | Medium | Trees | DFS / BFS | 54.7% | 50.0% | all |
| 465 | Optimal Account Balancing | Hard | Core DSA | Implementation / Reasoning | 50.5% | 50.0% | all |
| 490 | The Maze | Medium | Core DSA | Implementation / Reasoning | 60.4% | 50.0% | all |
| 516 | Longest Palindromic Subsequence | Medium | Core DSA | Implementation / Reasoning | 65.4% | 50.0% | all |
| 535 | Encode and Decode TinyURL | Medium | Dynamic Programming | State Transition | 86.6% | 50.0% | all |
| 636 | Exclusive Time of Functions | Medium | Core DSA | Implementation / Reasoning | 66.2% | 50.0% | all |
| 648 | Replace Words | Medium | Strings | Hashing / Sliding Window | 68.7% | 50.0% | all |
| 690 | Employee Importance | Medium | Core DSA | Implementation / Reasoning | 69.4% | 50.0% | all |
| 699 | Falling Squares | Hard | Core DSA | Implementation / Reasoning | 47.8% | 50.0% | all |
| 733 | Flood Fill | Easy | Core DSA | Implementation / Reasoning | 68.3% | 50.0% | all |
| 735 | Asteroid Collision | Medium | Core DSA | Implementation / Reasoning | 47.9% | 50.0% | all |
| 710 | Random Pick with Blacklist | Hard | Linked List | Two Pointers | 35.0% | 50.0% | all |
| 875 | Koko Eating Bananas | Medium | Binary Search | Binary Search | 50.0% | 50.0% | all |
| 959 | Regions Cut By Slashes | Medium | Core DSA | Implementation / Reasoning | 77.5% | 50.0% | all |
| 1064 | Fixed Point | Easy | Core DSA | Implementation / Reasoning | 64.1% | 50.0% | all |
| 1136 | Parallel Courses | Medium | Graphs | BFS / DFS / Topological Sort | 62.2% | 50.0% | all |
| 1039 | Minimum Score Triangulation of Polygon | Medium | Arrays | Sorting / Prefix / Scan | 67.5% | 50.0% | all |
| 1171 | Remove Zero Sum Consecutive Nodes from Linked List | Medium | Arrays; Trees; Linked List | Sorting / Prefix / Scan; DFS / BFS; Two Pointers | 53.2% | 50.0% | all |
| 1334 | Find the City With the Smallest Number of Neighbors at a Threshold Distance | Medium | Core DSA | Implementation / Reasoning | 72.8% | 50.0% | all |
| 1385 | Find the Distance Value Between Two Arrays | Easy | Arrays | Sorting / Prefix / Scan | 71.8% | 50.0% | all |
| 1400 | Construct K Palindrome Strings | Medium | Strings | Hashing / Sliding Window | 68.5% | 50.0% | all |
| 1462 | Course Schedule IV | Medium | Graphs | BFS / DFS / Topological Sort | 59.9% | 50.0% | all |
| 1519 | Number of Nodes in the Sub-Tree With the Same Label | Medium | Trees | DFS / BFS | 55.4% | 50.0% | all |
| 1579 | Remove Max Number of Edges to Keep Graph Fully Traversable | Hard | Graphs | BFS / DFS / Topological Sort | 70.2% | 50.0% | all |
| 1635 | Hopper Company Queries I | Hard | Core DSA | Implementation / Reasoning | 48.1% | 50.0% | all |
| 1645 | Hopper Company Queries II | Hard | Core DSA | Implementation / Reasoning | 39.9% | 50.0% | all |
| 1651 | Hopper Company Queries III | Hard | Core DSA | Implementation / Reasoning | 65.4% | 50.0% | all |
| 1719 | Number Of Ways To Reconstruct A Tree | Hard | Trees | DFS / BFS | 45.8% | 50.0% | all |
| 1705 | Maximum Number of Eaten Apples | Medium | Arrays | Sorting / Prefix / Scan | 43.4% | 50.0% | all |
| 1768 | Merge Strings Alternately | Easy | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 82.1% | 50.0% | all |
| 1829 | Maximum XOR for Each Query | Medium | Arrays | Sorting / Prefix / Scan | 84.7% | 50.0% | all |
| 1818 | Minimum Absolute Sum Difference | Medium | Arrays | Sorting / Prefix / Scan | 32.5% | 50.0% | all |
| 1856 | Maximum Subarray Min-Product | Medium | Arrays | Sorting / Prefix / Scan | 40.4% | 50.0% | all |
| 1926 | Nearest Exit from Entrance in Maze | Medium | Core DSA | Implementation / Reasoning | 48.6% | 50.0% | all |
| 2307 | Check for Contradictions in Equations | Hard | Core DSA | Implementation / Reasoning | 43.9% | 50.0% | all |
| 1968 | Array With Elements Not Equal to Average of Neighbors | Medium | Arrays | Sorting / Prefix / Scan | 50.8% | 50.0% | all |
| 1961 | Check If String Is a Prefix of Array | Easy | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 52.9% | 50.0% | all |
| 1967 | Number of Strings That Appear as Substrings in Word | Easy | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 82.6% | 50.0% | all |
| 2187 | Minimum Time to Complete Trips | Medium | Arrays | Sorting / Prefix / Scan | 39.8% | 50.0% | all |
| 2196 | Create Binary Tree From Descriptions | Medium | Trees | DFS / BFS | 81.7% | 50.0% | all |
| 2248 | Intersection of Multiple Arrays | Easy | Arrays | Sorting / Prefix / Scan | 68.7% | 50.0% | all |
| 2261 | K Divisible Elements Subarrays | Medium | Arrays | Sorting / Prefix / Scan | 55.0% | 50.0% | all |
| 2243 | Calculate Digit Sum of a String | Easy | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 67.8% | 50.0% | all |
| 2333 | Minimum Sum of Squared Difference | Medium | Arrays | Sorting / Prefix / Scan | 26.9% | 50.0% | all |
| 2282 | Number of People That Can Be Seen in a Grid | Medium | Core DSA | Implementation / Reasoning | 47.6% | 50.0% | all |
| 2508 | Add Edges to Make Degrees of All Nodes Even | Hard | Trees | DFS / BFS | 36.1% | 50.0% | all |
| 2555 | Maximize Win From Two Segments | Medium | Core DSA | Implementation / Reasoning | 37.7% | 50.0% | all |
| 2828 | Check if a String Is an Acronym of Words | Easy | Strings | Hashing / Sliding Window | 83.0% | 50.0% | all |
| 2848 | Points That Intersect With Cars | Easy | Core DSA | Implementation / Reasoning | 73.4% | 50.0% | all |
| 2912 | Number of Ways to Reach Destination in the Grid | Hard | Core DSA | Implementation / Reasoning | 57.8% | 50.0% | all |
| 3023 | Find Pattern in Infinite Stream I | Medium | Strings | Hashing / Sliding Window | 57.3% | 50.0% | all |
| 3037 | Find Pattern in Infinite Stream II | Hard | Strings | Hashing / Sliding Window | 67.4% | 50.0% | all |
| 3073 | Maximum Increasing Triplet Value | Medium | Arrays | Sorting / Prefix / Scan | 36.0% | 50.0% | all |
| 3078 | Match Alphanumerical Pattern in Matrix I | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 64.8% | 50.0% | all |
| 3191 | Minimum Operations to Make Binary Array Elements Equal to One I | Medium | Arrays | Sorting / Prefix / Scan | 80.4% | 50.0% | all |
| 3192 | Minimum Operations to Make Binary Array Elements Equal to One II | Medium | Arrays | Sorting / Prefix / Scan | 65.1% | 50.0% | all |
| 3027 | Find the Number of Ways to Place People II | Hard | Core DSA | Implementation / Reasoning | 64.4% | 50.0% | all |
| 3342 | Find Minimum Time to Reach Last Room II | Medium | Arrays | Sorting / Prefix / Scan | 67.6% | 50.0% | all |
| 3387 | Maximize Amount After Two Days of Conversions | Medium | Core DSA | Implementation / Reasoning | 61.4% | 50.0% | all |
| 2768 | Number of Black Blocks | Medium | Core DSA | Implementation / Reasoning | 41.8% | 50.0% | all |
| 3466 | Maximum Coin Collection | Medium | Arrays; Dynamic Programming | Sorting / Prefix / Scan; State Transition | 53.1% | 50.0% | all |
| 505 | The Maze II | Medium | Core DSA | Implementation / Reasoning | 55.1% | 50.0% | all |
| 3652 | Best Time to Buy and Sell Stock using Strategy | Medium | Core DSA | Implementation / Reasoning | 59.8% | 50.0% | all |
| 3868 | Minimum Cost to Equalize Arrays Using Swaps | Medium | Arrays | Sorting / Prefix / Scan | 48.5% | 50.0% | all |
| 227 | Basic Calculator II | Medium | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 37.5% | 6m |
| 2163 | Minimum Difference in Sums After Removal of Elements | Hard | Arrays | Sorting / Prefix / Scan | 69.6% | 37.5% | 6m |
| 752 | Open the Lock | Medium | Core DSA | Implementation / Reasoning | 61.3% | 37.5% | 6m |
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 37.5% | 6m |
| 2092 | Find All People With Secret | Hard | Core DSA | Implementation / Reasoning | 48.4% | 37.5% | 6m |
| 2561 | Rearranging Fruits | Hard | Core DSA | Implementation / Reasoning | 57.3% | 37.5% | 6m |
| 545 | Boundary of Binary Tree | Medium | Trees | DFS / BFS | 48.1% | 37.5% | 6m |
| 127 | Word Ladder | Hard | Strings | Hashing / Sliding Window | 45.6% | 37.5% | 6m |
| 1423 | Maximum Points You Can Obtain from Cards | Medium | Arrays | Sorting / Prefix / Scan | 57.7% | 37.5% | 6m |
| 128 | Longest Consecutive Sequence | Medium | Core DSA | Implementation / Reasoning | 47.1% | 37.5% | 6m |
| 719 | Find K-th Smallest Pair Distance | Hard | Core DSA | Implementation / Reasoning | 46.5% | 37.5% | 6m |
| 1244 | Design A Leaderboard | Medium | Design | Data Structure Design | 68.1% | 37.5% | 6m |
| 3419 | Minimize the Maximum Edge Weight of Graph | Medium | Arrays; Graphs | Sorting / Prefix / Scan; BFS / DFS / Topological Sort | 44.6% | 37.5% | 6m |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 37.5% | 6m |
| 2467 | Most Profitable Path in a Tree | Medium | Trees | DFS / BFS | 67.3% | 37.5% | 6m |
| 1966 | Binary Searchable Numbers in an Unsorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 63.8% | 37.5% | 6m |
| 692 | Top K Frequent Words | Medium | Strings; Heap | Hashing / Sliding Window; Priority Queue | 60.2% | 37.5% | 6m |
| 3356 | Zero Array Transformation II | Medium | Arrays | Sorting / Prefix / Scan | 43.6% | 37.5% | 6m |
| 14 | Longest Common Prefix | Easy | Core DSA | Implementation / Reasoning | 47.6% | 37.5% | all |
| 31 | Next Permutation | Medium | Backtracking | Backtracking | 45.3% | 37.5% | all |
| 34 | Find First and Last Position of Element in Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 48.9% | 37.5% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 37.5% | all |
| 48 | Rotate Image | Medium | Arrays | Sorting / Prefix / Scan | 80.1% | 37.5% | all |