DSA Doctor
Verified Company Vault
30d Active
Meta DSA Interview Questions
1366 curated coding interview questions directly asked in Meta technical rounds, sorted by frequency with recency and difficulty diagnostics.
1366
Total Questions
412 (30%)
Easy Problems
747 (55%)
Medium Problems
207 (15%)
Hard Problems
🔥 Most Tested Topics:
Core DSA (482)Arrays (479)Strings (205)Trees (163)Linked List (48)
📂 Sourced Datasets:
Last 30 daysLast 3 monthsLast 6 monthsAll questionsOlder than 6 months
Showing top 200 of 1366 questions. View all 1366 in the interactive tracker.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 100.0% | 30d |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 87.5% | 3m |
| 125 | Valid Palindrome | Easy | Strings | Hashing / Sliding Window | 53.3% | 87.5% | 3m |
| 408 | Valid Word Abbreviation | Easy | Strings | Hashing / Sliding Window | 37.0% | 87.5% | 3m |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 75.0% | 30d |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 75.0% | 30d |
| 1539 | Kth Missing Positive Number | Easy | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 63.5% | 75.0% | 30d |
| 4 | Median of Two Sorted Arrays | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 46.6% | 75.0% | 3m |
| 26 | Remove Duplicates from Sorted Array | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 62.8% | 75.0% | 3m |
| 50 | Pow(x, n) | Medium | Core DSA | Implementation / Reasoning | 38.7% | 75.0% | 3m |
| 199 | Binary Tree Right Side View | Medium | Trees | DFS / BFS | 70.2% | 75.0% | 3m |
| 236 | Lowest Common Ancestor of a Binary Tree | Medium | Trees | DFS / BFS | 69.3% | 75.0% | 3m |
| 314 | Binary Tree Vertical Order Traversal | Medium | Trees | DFS / BFS | 57.8% | 75.0% | 3m |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 75.0% | 3m |
| 647 | Palindromic Substrings | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 72.8% | 75.0% | 3m |
| 680 | Valid Palindrome II | Easy | Strings | Hashing / Sliding Window | 44.3% | 75.0% | 3m |
| 528 | Random Pick with Weight | Medium | Core DSA | Implementation / Reasoning | 49.1% | 75.0% | 3m |
| 1249 | Minimum Remove to Make Valid Parentheses | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 71.5% | 62.5% | 30d |
| 339 | Nested List Weight Sum | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 86.0% | 62.5% | 30d |
| 1004 | Max Consecutive Ones III | Medium | Core DSA | Implementation / Reasoning | 67.7% | 62.5% | 30d |
| 1650 | Lowest Common Ancestor of a Binary Tree III | Medium | Trees | DFS / BFS | 83.0% | 62.5% | 30d |
| 396 | Rotate Function | Medium | Arrays | Sorting / Prefix / Scan | 54.1% | 62.5% | 30d |
| 65 | Valid Number | Hard | Strings | Hashing / Sliding Window | 23.0% | 62.5% | 30d |
| 238 | Product of Array Except Self | Medium | Arrays | Sorting / Prefix / Scan | 68.9% | 62.5% | 30d |
| 82 | Remove Duplicates from Sorted List II | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 51.8% | 62.5% | 30d |
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 62.5% | 30d |
| 1674 | Minimum Moves to Make Array Complementary | Medium | Arrays | Sorting / Prefix / Scan | 65.0% | 62.5% | 30d |
| 18 | 4Sum | Medium | Arrays | Sorting / Prefix / Scan | 40.6% | 62.5% | 30d |
| 73 | Set Matrix Zeroes | Medium | Arrays | Sorting / Prefix / Scan | 62.9% | 62.5% | 30d |
| 55 | Jump Game | Medium | Greedy | Greedy | 40.9% | 62.5% | 30d |
| 88 | Merge Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 54.9% | 62.5% | 30d |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 62.5% | 30d |
| 543 | Diameter of Binary Tree | Easy | Trees | DFS / BFS | 65.5% | 62.5% | 30d |
| 525 | Contiguous Array | Medium | Arrays | Sorting / Prefix / Scan | 51.3% | 62.5% | 30d |
| 209 | Minimum Size Subarray Sum | Medium | Arrays | Sorting / Prefix / Scan | 51.7% | 62.5% | 30d |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 62.5% | 30d |
| 2 | Add Two Numbers | Medium | Core DSA | Implementation / Reasoning | 48.5% | 62.5% | 3m |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 62.5% | 3m |
| 15 | 3Sum | Medium | Arrays | Sorting / Prefix / Scan | 39.1% | 62.5% | 3m |
| 31 | Next Permutation | Medium | Backtracking | Backtracking | 45.3% | 62.5% | 3m |
| 34 | Find First and Last Position of Element in Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 48.9% | 62.5% | 3m |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 62.5% | 3m |
| 71 | Simplify Path | Medium | Core DSA | Implementation / Reasoning | 50.6% | 62.5% | 3m |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 62.5% | 3m |
| 162 | Find Peak Element | Medium | Binary Search | Binary Search | 47.0% | 62.5% | 3m |
| 207 | Course Schedule | Medium | Graphs | BFS / DFS / Topological Sort | 51.4% | 62.5% | 3m |
| 827 | Making A Large Island | Hard | Graphs | BFS / DFS / Topological Sort | 56.6% | 62.5% | 3m |
| 1762 | Buildings With an Ocean View | Medium | Core DSA | Implementation / Reasoning | 80.9% | 62.5% | 3m |
| 921 | Minimum Add to Make Parentheses Valid | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 74.4% | 62.5% | 3m |
| 938 | Range Sum of BST | Easy | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 87.6% | 62.5% | 3m |
| 973 | K Closest Points to Origin | Medium | Core DSA | Implementation / Reasoning | 69.0% | 62.5% | 3m |
| 21 | Merge Two Sorted Lists | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 68.3% | 62.5% | 3m |
| 13 | Roman to Integer | Easy | Strings | Hashing / Sliding Window | 66.6% | 62.5% | 3m |
| 32 | Longest Valid Parentheses | Hard | Strings | Hashing / Sliding Window | 38.8% | 62.5% | 3m |
| 16 | 3Sum Closest | Medium | Arrays | Sorting / Prefix / Scan | 48.6% | 62.5% | 3m |
| 17 | Letter Combinations of a Phone Number | Medium | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 66.1% | 62.5% | 6m |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 62.5% | 6m |
| 70 | Climbing Stairs | Easy | Dynamic Programming | State Transition | 54.1% | 62.5% | 6m |
| 282 | Expression Add Operators | Hard | Core DSA | Implementation / Reasoning | 43.2% | 62.5% | all |
| 398 | Random Pick Index | Medium | Core DSA | Implementation / Reasoning | 65.1% | 62.5% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 50.0% | 3m |
| 14 | Longest Common Prefix | Easy | Core DSA | Implementation / Reasoning | 47.6% | 50.0% | 3m |
| 23 | Merge k Sorted Lists | Hard | Arrays; Linked List; Heap | Sorting / Prefix / Scan; Two Pointers; Priority Queue | 59.6% | 50.0% | 3m |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 50.0% | 3m |
| 129 | Sum Root to Leaf Numbers | Medium | Arrays | Sorting / Prefix / Scan | 70.0% | 50.0% | 3m |
| 138 | Copy List with Random Pointer | Medium | Linked List | Two Pointers | 62.9% | 50.0% | 3m |
| 1091 | Shortest Path in Binary Matrix | Medium | Arrays | Sorting / Prefix / Scan | 51.5% | 50.0% | 3m |
| 215 | Kth Largest Element in an Array | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 68.9% | 50.0% | 3m |
| 227 | Basic Calculator II | Medium | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 50.0% | 3m |
| 283 | Move Zeroes | Easy | Core DSA | Two Pointers | 63.8% | 50.0% | 3m |
| 636 | Exclusive Time of Functions | Medium | Core DSA | Implementation / Reasoning | 66.2% | 50.0% | 3m |
| 791 | Custom Sort String | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 72.3% | 50.0% | 3m |
| 824 | Goat Latin | Easy | Core DSA | Implementation / Reasoning | 70.0% | 50.0% | 3m |
| 249 | Group Shifted Strings | Medium | Strings | Hashing / Sliding Window | 67.8% | 50.0% | 3m |
| 1047 | Remove All Adjacent Duplicates In String | Easy | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 73.2% | 50.0% | 3m |
| 22 | Generate Parentheses | Medium | Strings | Hashing / Sliding Window | 78.7% | 50.0% | 3m |
| 545 | Boundary of Binary Tree | Medium | Trees | DFS / BFS | 48.1% | 50.0% | 3m |
| 242 | Valid Anagram | Easy | Strings | Hashing / Sliding Window | 68.1% | 50.0% | 3m |
| 489 | Robot Room Cleaner | Hard | Core DSA | Implementation / Reasoning | 78.0% | 50.0% | 3m |
| 11 | Container With Most Water | Medium | Core DSA | Two Pointers | 60.0% | 50.0% | 3m |
| 349 | Intersection of Two Arrays | Easy | Arrays | Sorting / Prefix / Scan | 77.8% | 50.0% | 3m |
| 419 | Battleships in a Board | Medium | Binary Search | Binary Search | 77.5% | 50.0% | 3m |
| 39 | Combination Sum | Medium | Arrays; Backtracking | Sorting / Prefix / Scan; Backtracking | 76.5% | 50.0% | 3m |
| 1929 | Concatenation of Array | Easy | Arrays | Sorting / Prefix / Scan | 90.3% | 50.0% | 3m |
| 51 | N-Queens | Hard | Backtracking | Backtracking | 75.5% | 50.0% | 3m |
| 77 | Combinations | Medium | Backtracking | Backtracking | 74.6% | 50.0% | 3m |
| 41 | First Missing Positive | Hard | Arrays | Sorting / Prefix / Scan | 42.9% | 50.0% | 3m |
| 412 | Fizz Buzz | Easy | Core DSA | Implementation / Reasoning | 75.5% | 50.0% | 3m |
| 778 | Swim in Rising Water | Hard | Core DSA | Implementation / Reasoning | 67.8% | 50.0% | 3m |
| 231 | Power of Two | Easy | Core DSA | Implementation / Reasoning | 50.1% | 50.0% | 3m |
| 480 | Sliding Window Median | Hard | Heap | Priority Queue; Sliding Window | 39.0% | 50.0% | 3m |
| 9 | Palindrome Number | Easy | Strings | Hashing / Sliding Window | 60.6% | 50.0% | 3m |
| 322 | Coin Change | Medium | Dynamic Programming | State Transition | 48.4% | 50.0% | 3m |
| 987 | Vertical Order Traversal of a Binary Tree | Hard | Trees | DFS / BFS | 53.8% | 50.0% | 3m |
| 863 | All Nodes Distance K in Binary Tree | Medium | Trees | DFS / BFS | 67.7% | 50.0% | 3m |
| 143 | Reorder List | Medium | Linked List | Two Pointers | 65.3% | 50.0% | 3m |
| 167 | Two Sum II - Input Array Is Sorted | Medium | Arrays | Sorting / Prefix / Scan; Two Pointers | 65.1% | 50.0% | 3m |
| 128 | Longest Consecutive Sequence | Medium | Core DSA | Implementation / Reasoning | 47.1% | 50.0% | 3m |
| 1888 | Minimum Number of Flips to Make the Binary String Alternating | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 53.5% | 50.0% | 3m |
| 529 | Minesweeper | Medium | Core DSA | Implementation / Reasoning | 68.8% | 50.0% | 3m |
| 678 | Valid Parenthesis String | Medium | Strings | Hashing / Sliding Window | 40.1% | 50.0% | 3m |
| 84 | Largest Rectangle in Histogram | Hard | Core DSA | Implementation / Reasoning | 49.9% | 50.0% | 3m |
| 62 | Unique Paths | Medium | Core DSA | Implementation / Reasoning | 66.8% | 50.0% | 3m |
| 549 | Binary Tree Longest Consecutive Sequence II | Medium | Trees | DFS / BFS | 50.1% | 50.0% | 3m |
| 498 | Diagonal Traverse | Medium | Core DSA | Implementation / Reasoning | 67.2% | 50.0% | 3m |
| 28 | Find the Index of the First Occurrence in a String | Easy | Strings | Hashing / Sliding Window | 46.7% | 50.0% | 3m |
| 124 | Binary Tree Maximum Path Sum | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 42.3% | 50.0% | 3m |
| 189 | Rotate Array | Medium | Arrays | Sorting / Prefix / Scan | 44.9% | 50.0% | 3m |
| 796 | Rotate String | Easy | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 66.6% | 50.0% | 3m |
| 66 | Plus One | Easy | Core DSA | Implementation / Reasoning | 50.0% | 50.0% | 3m |
| 1239 | Maximum Length of a Concatenated String with Unique Characters | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 54.8% | 50.0% | 3m |
| 3761 | Minimum Absolute Distance Between Mirror Pairs | Medium | Arrays | Sorting / Prefix / Scan | 59.2% | 50.0% | 3m |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 50.0% | 3m |
| 27 | Remove Element | Easy | Core DSA | Implementation / Reasoning | 61.8% | 50.0% | 3m |
| 7 | Reverse Integer | Medium | Core DSA | Implementation / Reasoning | 31.9% | 50.0% | 6m |
| 8 | String to Integer (atoi) | Medium | Strings | Hashing / Sliding Window | 21.0% | 50.0% | 6m |
| 69 | Sqrt(x) | Easy | Binary Search | Binary Search | 41.8% | 50.0% | 6m |
| 169 | Majority Element | Easy | Core DSA | Implementation / Reasoning | 66.3% | 50.0% | 6m |
| 217 | Contains Duplicate | Easy | Arrays | Sorting / Prefix / Scan | 64.4% | 50.0% | 6m |
| 219 | Contains Duplicate II | Easy | Arrays | Sorting / Prefix / Scan | 51.3% | 50.0% | 6m |
| 234 | Palindrome Linked List | Easy | Strings; Linked List | Hashing / Sliding Window; Two Pointers | 58.0% | 50.0% | 6m |
| 269 | Alien Dictionary | Hard | Graphs | BFS / DFS / Topological Sort | 37.2% | 50.0% | 6m |
| 443 | String Compression | Medium | Strings | Hashing / Sliding Window | 60.0% | 50.0% | 6m |
| 670 | Maximum Swap | Medium | Arrays | Sorting / Prefix / Scan | 52.0% | 50.0% | 6m |
| 735 | Asteroid Collision | Medium | Core DSA | Implementation / Reasoning | 47.9% | 50.0% | 6m |
| 825 | Friends Of Appropriate Ages | Medium | Core DSA | Implementation / Reasoning | 49.9% | 50.0% | 6m |
| 485 | Max Consecutive Ones | Easy | Core DSA | Implementation / Reasoning | 65.2% | 50.0% | 6m |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 50.0% | 6m |
| 152 | Maximum Product Subarray | Medium | Arrays | Sorting / Prefix / Scan | 36.4% | 50.0% | 6m |
| 1752 | Check if Array Is Sorted and Rotated | Easy | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 57.2% | 50.0% | 6m |
| 509 | Fibonacci Number | Easy | Core DSA | Implementation / Reasoning | 74.1% | 50.0% | 6m |
| 438 | Find All Anagrams in a String | Medium | Strings | Hashing / Sliding Window | 53.8% | 50.0% | 6m |
| 1266 | Minimum Time Visiting All Points | Easy | Arrays | Sorting / Prefix / Scan | 84.8% | 50.0% | 6m |
| 3507 | Minimum Pair Removal to Sort Array I | Easy | Arrays | Sorting / Prefix / Scan | 65.2% | 50.0% | 6m |
| 38 | Count and Say | Medium | Core DSA | Implementation / Reasoning | 62.9% | 50.0% | all |
| 43 | Multiply Strings | Medium | Strings | Hashing / Sliding Window | 44.2% | 50.0% | all |
| 163 | Missing Ranges | Easy | Arrays | Sorting / Prefix / Scan | 35.7% | 50.0% | all |
| 235 | Lowest Common Ancestor of a Binary Search Tree | Medium | Trees; Binary Search | DFS / BFS; Binary Search | 70.6% | 50.0% | all |
| 246 | Strobogrammatic Number | Easy | Core DSA | Implementation / Reasoning | 47.5% | 50.0% | all |
| 295 | Find Median from Data Stream | Hard | Heap | Priority Queue | 54.5% | 50.0% | all |
| 348 | Design Tic-Tac-Toe | Medium | Design | Data Structure Design | 58.7% | 50.0% | all |
| 380 | Insert Delete GetRandom O(1) | Medium | Core DSA | Implementation / Reasoning | 55.4% | 50.0% | all |
| 394 | Decode String | Medium | Strings; Dynamic Programming; Stack / Queue | Hashing / Sliding Window; State Transition; Monotonic Stack / Simulation | 62.6% | 50.0% | all |
| 494 | Target Sum | Medium | Arrays | Sorting / Prefix / Scan | 52.2% | 50.0% | all |
| 536 | Construct Binary Tree from String | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 58.7% | 50.0% | all |
| 658 | Find K Closest Elements | Medium | Core DSA | Implementation / Reasoning | 49.7% | 50.0% | all |
| 958 | Check Completeness of a Binary Tree | Medium | Trees | DFS / BFS | 59.2% | 50.0% | all |
| 1060 | Missing Element in Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 59.7% | 50.0% | all |
| 1209 | Remove All Adjacent Duplicates in String II | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 61.3% | 50.0% | all |
| 1443 | Minimum Time to Collect All Apples in a Tree | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 63.7% | 50.0% | all |
| 2235 | Add Two Integers | Easy | Core DSA | Implementation / Reasoning | 88.0% | 50.0% | all |
| 2667 | Create Hello World Function | Easy | Core DSA | Implementation / Reasoning | 81.9% | 50.0% | all |
| 270 | Closest Binary Search Tree Value | Easy | Trees; Binary Search | DFS / BFS; Binary Search | 49.2% | 37.5% | 3m |
| 346 | Moving Average from Data Stream | Easy | Core DSA | Implementation / Reasoning | 80.2% | 37.5% | 3m |
| 1570 | Dot Product of Two Sparse Vectors | Medium | Arrays | Sorting / Prefix / Scan | 89.9% | 37.5% | 3m |
| 76 | Minimum Window Substring | Hard | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS; Sliding Window | 47.5% | 37.5% | 3m |
| 48 | Rotate Image | Medium | Arrays | Sorting / Prefix / Scan | 80.1% | 37.5% | 3m |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 37.5% | 3m |
| 58 | Length of Last Word | Easy | Strings | Hashing / Sliding Window | 58.8% | 37.5% | 3m |
| 540 | Single Element in a Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 59.3% | 37.5% | 3m |
| 287 | Find the Duplicate Number | Medium | Arrays | Sorting / Prefix / Scan | 64.3% | 37.5% | 3m |
| 733 | Flood Fill | Easy | Core DSA | Implementation / Reasoning | 68.3% | 37.5% | 3m |
| 123 | Best Time to Buy and Sell Stock III | Hard | Core DSA | Implementation / Reasoning | 53.7% | 37.5% | 3m |
| 46 | Permutations | Medium | Backtracking | Backtracking | 81.9% | 37.5% | 3m |
| 110 | Balanced Binary Tree | Easy | Trees | DFS / BFS | 58.4% | 37.5% | 3m |
| 1382 | Balance a Binary Search Tree | Medium | Trees; Binary Search | DFS / BFS; Binary Search | 86.3% | 37.5% | 3m |
| 496 | Next Greater Element I | Easy | Stack / Queue | Monotonic Stack / Simulation | 76.1% | 37.5% | 3m |
| 1971 | Find if Path Exists in Graph | Easy | Graphs | BFS / DFS / Topological Sort | 55.2% | 37.5% | 3m |
| 2265 | Count Nodes Equal to Average of Subtree | Medium | Trees | DFS / BFS | 86.8% | 37.5% | 3m |
| 175 | Combine Two Tables | Easy | Core DSA | Implementation / Reasoning | 79.5% | 37.5% | 3m |
| 1143 | Longest Common Subsequence | Medium | Core DSA | Implementation / Reasoning | 59.2% | 37.5% | 3m |
| 724 | Find Pivot Index | Easy | Core DSA | Implementation / Reasoning | 62.7% | 37.5% | 3m |
| 61 | Rotate List | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 42.6% | 37.5% | 3m |
| 381 | Insert Delete GetRandom O(1) - Duplicates allowed | Hard | Arrays | Sorting / Prefix / Scan | 36.6% | 37.5% | 3m |
| 3129 | Find All Possible Stable Binary Arrays I | Medium | Arrays | Sorting / Prefix / Scan | 53.7% | 37.5% | 3m |
| 708 | Insert into a Sorted Circular Linked List | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 38.6% | 37.5% | 3m |
| 875 | Koko Eating Bananas | Medium | Binary Search | Binary Search | 50.0% | 37.5% | 3m |
| 127 | Word Ladder | Hard | Strings | Hashing / Sliding Window | 45.6% | 37.5% | 3m |
| 177 | Nth Highest Salary | Medium | Core DSA | Implementation / Reasoning | 39.2% | 37.5% | 3m |
| 1424 | Diagonal Traverse II | Medium | Core DSA | Implementation / Reasoning | 58.3% | 37.5% | 3m |
| 695 | Max Area of Island | Medium | Graphs | BFS / DFS / Topological Sort | 74.0% | 37.5% | 3m |
| 584 | Find Customer Referee | Easy | Core DSA | Implementation / Reasoning | 72.9% | 37.5% | 3m |
| 202 | Happy Number | Easy | Core DSA | Implementation / Reasoning | 59.7% | 37.5% | 3m |
| 904 | Fruit Into Baskets | Medium | Core DSA | Implementation / Reasoning | 51.1% | 37.5% | 3m |
| 585 | Investments in 2016 | Medium | Core DSA | Implementation / Reasoning | 51.1% | 37.5% | 3m |
| 133 | Clone Graph | Medium | Graphs | BFS / DFS / Topological Sort | 65.3% | 37.5% | 3m |
| 104 | Maximum Depth of Binary Tree | Easy | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 78.2% | 37.5% | 3m |
| 286 | Walls and Gates | Medium | Core DSA | Implementation / Reasoning | 64.0% | 37.5% | 3m |
| 150 | Evaluate Reverse Polish Notation | Medium | Core DSA | Implementation / Reasoning | 57.8% | 37.5% | 3m |
| 541 | Reverse String II | Easy | Strings | Hashing / Sliding Window | 53.8% | 37.5% | 3m |
| 122 | Best Time to Buy and Sell Stock II | Medium | Core DSA | Implementation / Reasoning | 71.1% | 37.5% | 3m |
| 986 | Interval List Intersections | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 73.0% | 37.5% | 3m |
| 80 | Remove Duplicates from Sorted Array II | Medium | Arrays | Sorting / Prefix / Scan; Two Pointers | 64.7% | 37.5% | 3m |
| 1914 | Cyclically Rotating a Grid | Medium | Core DSA | Implementation / Reasoning | 74.1% | 37.5% | 3m |
| 645 | Set Mismatch | Easy | Core DSA | Implementation / Reasoning | 43.6% | 37.5% | 3m |
| 1174 | Immediate Food Delivery II | Medium | Core DSA | Implementation / Reasoning | 56.0% | 37.5% | 3m |
| 153 | Find Minimum in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 54.7% | 37.5% | 3m |
| 373 | Find K Pairs with Smallest Sums | Medium | Arrays | Sorting / Prefix / Scan | 41.9% | 37.5% | 3m |
| 36 | Valid Sudoku | Medium | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 64.5% | 37.5% | 3m |
| 29 | Divide Two Integers | Medium | Core DSA | Implementation / Reasoning | 19.8% | 37.5% | 3m |