1374 curated coding interview questions directly asked in Microsoft technical rounds, sorted by frequency with recency and difficulty diagnostics.
Showing top 200 of 1374 questions. View all 1374 in the interactive tracker.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 2 | Add Two Numbers | Medium | Core DSA | Implementation / Reasoning | 48.5% | 100.0% | 30d |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 87.5% | 30d |
| 14 | Longest Common Prefix | Easy | Core DSA | Implementation / Reasoning | 47.6% | 87.5% | 30d |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 87.5% | 3m |
| 7 | Reverse Integer | Medium | Core DSA | Implementation / Reasoning | 31.9% | 75.0% | 30d |
| 1932 | Merge BSTs to Create Single BST | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 38.9% | 75.0% | 30d |
| 32 | Longest Valid Parentheses | Hard | Strings | Hashing / Sliding Window | 38.8% | 75.0% | 30d |
| 2553 | Separate the Digits in an Array | Easy | Arrays | Sorting / Prefix / Scan | 85.8% | 75.0% | 30d |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 75.0% | 30d |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 75.0% | 30d |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 75.0% | 30d |
| 75 | Sort Colors | Medium | Arrays | Sorting / Prefix / Scan | 69.6% | 75.0% | 30d |
| 2784 | Check if Array is Good | Easy | Arrays | Sorting / Prefix / Scan | 57.3% | 75.0% | 30d |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 75.0% | 30d |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 75.0% | 30d |
| 128 | Longest Consecutive Sequence | Medium | Core DSA | Implementation / Reasoning | 47.1% | 75.0% | 30d |
| 176 | Second Highest Salary | Medium | Core DSA | Implementation / Reasoning | 47.0% | 75.0% | 30d |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 75.0% | 30d |
| 193 | Valid Phone Numbers | Easy | Strings | Hashing / Sliding Window | 29.7% | 75.0% | 30d |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 75.0% | 3m |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 75.0% | 3m |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 75.0% | 3m |
| 22 | Generate Parentheses | Medium | Strings | Hashing / Sliding Window | 78.7% | 75.0% | 3m |
| 11 | Container With Most Water | Medium | Core DSA | Two Pointers | 60.0% | 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 |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 62.5% | 3m |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 62.5% | 3m |
| 51 | N-Queens | Hard | Backtracking | Backtracking | 75.5% | 62.5% | 3m |
| 23 | Merge k Sorted Lists | Hard | Arrays; Linked List; Heap | Sorting / Prefix / Scan; Two Pointers; Priority Queue | 59.6% | 62.5% | 3m |
| 253 | Meeting Rooms II | Medium | Greedy | Greedy | 52.7% | 62.5% | 3m |
| 2858 | Minimum Edge Reversals So Every Node Is Reachable | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 59.5% | 62.5% | 3m |
| 509 | Fibonacci Number | Easy | Core DSA | Implementation / Reasoning | 74.1% | 62.5% | 3m |
| 1475 | Final Prices With a Special Discount in a Shop | Easy | Core DSA | Implementation / Reasoning | 84.1% | 62.5% | 3m |
| 202 | Happy Number | Easy | Core DSA | Implementation / Reasoning | 59.7% | 62.5% | 3m |
| 875 | Koko Eating Bananas | Medium | Binary Search | Binary Search | 50.0% | 62.5% | 3m |
| 76 | Minimum Window Substring | Hard | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS; Sliding Window | 47.5% | 62.5% | 3m |
| 300 | Longest Increasing Subsequence | Medium | Dynamic Programming | State Transition | 59.4% | 62.5% | 3m |
| 295 | Find Median from Data Stream | Hard | Heap | Priority Queue | 54.5% | 62.5% | 3m |
| 88 | Merge Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 54.9% | 62.5% | 3m |
| 283 | Move Zeroes | Easy | Core DSA | Two Pointers | 63.8% | 62.5% | 6m |
| 175 | Combine Two Tables | Easy | Core DSA | Implementation / Reasoning | 79.5% | 62.5% | 6m |
| 101 | Symmetric Tree | Easy | Trees | DFS / BFS | 61.2% | 62.5% | 6m |
| 13 | Roman to Integer | Easy | Strings | Hashing / Sliding Window | 66.6% | 50.0% | 3m |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 50.0% | 3m |
| 26 | Remove Duplicates from Sorted Array | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 62.8% | 50.0% | 3m |
| 48 | Rotate Image | Medium | Arrays | Sorting / Prefix / Scan | 80.1% | 50.0% | 3m |
| 206 | Reverse Linked List | Easy | Linked List | Two Pointers | 80.6% | 50.0% | 3m |
| 189 | Rotate Array | Medium | Arrays | Sorting / Prefix / Scan | 44.9% | 50.0% | 3m |
| 496 | Next Greater Element I | Easy | Stack / Queue | Monotonic Stack / Simulation | 76.1% | 50.0% | 3m |
| 424 | Longest Repeating Character Replacement | Medium | Strings | Hashing / Sliding Window | 59.7% | 50.0% | 3m |
| 70 | Climbing Stairs | Easy | Dynamic Programming | State Transition | 54.1% | 50.0% | 3m |
| 138 | Copy List with Random Pointer | Medium | Linked List | Two Pointers | 62.9% | 50.0% | 3m |
| 2667 | Create Hello World Function | Easy | Core DSA | Implementation / Reasoning | 81.9% | 50.0% | 3m |
| 102 | Binary Tree Level Order Traversal | Medium | Trees | DFS / BFS | 72.7% | 50.0% | 3m |
| 6 | Zigzag Conversion | Medium | Core DSA | Implementation / Reasoning | 54.2% | 50.0% | 3m |
| 17 | Letter Combinations of a Phone Number | Medium | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 66.1% | 50.0% | 3m |
| 242 | Valid Anagram | Easy | Strings | Hashing / Sliding Window | 68.1% | 50.0% | 3m |
| 273 | Integer to English Words | Hard | Strings | Hashing / Sliding Window | 35.0% | 50.0% | 3m |
| 540 | Single Element in a Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 59.3% | 50.0% | 3m |
| 28 | Find the Index of the First Occurrence in a String | Easy | Strings | Hashing / Sliding Window | 46.7% | 50.0% | 3m |
| 73 | Set Matrix Zeroes | Medium | Arrays | Sorting / Prefix / Scan | 62.9% | 50.0% | 3m |
| 647 | Palindromic Substrings | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 72.8% | 50.0% | 3m |
| 199 | Binary Tree Right Side View | Medium | Trees | DFS / BFS | 70.2% | 50.0% | 3m |
| 460 | LFU Cache | Hard | Design | Data Structure Design | 49.2% | 50.0% | 3m |
| 217 | Contains Duplicate | Easy | Arrays | Sorting / Prefix / Scan | 64.4% | 50.0% | 3m |
| 475 | Heaters | Medium | Core DSA | Implementation / Reasoning | 41.9% | 50.0% | 3m |
| 167 | Two Sum II - Input Array Is Sorted | Medium | Arrays | Sorting / Prefix / Scan; Two Pointers | 65.1% | 50.0% | 3m |
| 1353 | Maximum Number of Events That Can Be Attended | Medium | Arrays | Sorting / Prefix / Scan | 39.0% | 50.0% | 3m |
| 155 | Min Stack | Medium | Stack / Queue | Monotonic Stack / Simulation | 58.2% | 50.0% | 3m |
| 387 | First Unique Character in a String | Easy | Strings | Hashing / Sliding Window | 65.5% | 50.0% | 3m |
| 125 | Valid Palindrome | Easy | Strings | Hashing / Sliding Window | 53.3% | 50.0% | 3m |
| 12 | Integer to Roman | Medium | Strings | Hashing / Sliding Window | 71.0% | 50.0% | 3m |
| 45 | Jump Game II | Medium | Greedy | Greedy | 42.9% | 50.0% | 3m |
| 297 | Serialize and Deserialize Binary Tree | Hard | Trees; Design | DFS / BFS; Data Structure Design | 60.8% | 50.0% | 3m |
| 232 | Implement Queue using Stacks | Easy | Stack / Queue | Monotonic Stack / Simulation | 69.8% | 50.0% | 3m |
| 1929 | Concatenation of Array | Easy | Arrays | Sorting / Prefix / Scan | 90.3% | 50.0% | 3m |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 50.0% | 3m |
| 46 | Permutations | Medium | Backtracking | Backtracking | 81.9% | 50.0% | 3m |
| 139 | Word Break | Medium | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 49.5% | 50.0% | 3m |
| 55 | Jump Game | Medium | Greedy | Greedy | 40.9% | 50.0% | 3m |
| 67 | Add Binary | Easy | Core DSA | Implementation / Reasoning | 58.1% | 50.0% | 3m |
| 224 | Basic Calculator | Hard | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 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 |
| 986 | Interval List Intersections | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 73.0% | 50.0% | 3m |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 50.0% | 3m |
| 721 | Accounts Merge | Medium | Arrays | Sorting / Prefix / Scan | 61.3% | 50.0% | 3m |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | Trees | DFS / BFS | 68.8% | 50.0% | 3m |
| 657 | Robot Return to Origin | Easy | Core DSA | Implementation / Reasoning | 78.1% | 50.0% | 3m |
| 1004 | Max Consecutive Ones III | Medium | Core DSA | Implementation / Reasoning | 67.7% | 50.0% | 3m |
| 18 | 4Sum | Medium | Arrays | Sorting / Prefix / Scan | 40.6% | 50.0% | 3m |
| 61 | Rotate List | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 42.6% | 50.0% | 3m |
| 34 | Find First and Last Position of Element in Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 48.9% | 50.0% | 6m |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 50.0% | 6m |
| 93 | Restore IP Addresses | Medium | Core DSA | Implementation / Reasoning | 56.0% | 50.0% | 6m |
| 19 | Remove Nth Node From End of List | Medium | Trees; Linked List | DFS / BFS; Two Pointers | 51.6% | 50.0% | 6m |
| 162 | Find Peak Element | Medium | Binary Search | Binary Search | 47.0% | 50.0% | 6m |
| 169 | Majority Element | Easy | Core DSA | Implementation / Reasoning | 66.3% | 50.0% | 6m |
| 215 | Kth Largest Element in an Array | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 68.9% | 50.0% | 6m |
| 394 | Decode String | Medium | Strings; Dynamic Programming; Stack / Queue | Hashing / Sliding Window; State Transition; Monotonic Stack / Simulation | 62.6% | 50.0% | 6m |
| 78 | Subsets | Medium | Backtracking | Backtracking | 82.3% | 50.0% | 6m |
| 485 | Max Consecutive Ones | Easy | Core DSA | Implementation / Reasoning | 65.2% | 50.0% | 6m |
| 118 | Pascal's Triangle | Easy | Core DSA | Implementation / Reasoning | 78.9% | 50.0% | 6m |
| 179 | Largest Number | Medium | Core DSA | Implementation / Reasoning | 43.1% | 50.0% | 6m |
| 761 | Special Binary String | Hard | Strings | Hashing / Sliding Window | 79.3% | 50.0% | 6m |
| 1797 | Design Authentication Manager | Medium | Design | Data Structure Design | 58.6% | 50.0% | 6m |
| 577 | Employee Bonus | Easy | Core DSA | Implementation / Reasoning | 77.4% | 50.0% | 6m |
| 696 | Count Binary Substrings | Easy | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 70.4% | 50.0% | 6m |
| 3507 | Minimum Pair Removal to Sort Array I | Easy | Arrays | Sorting / Prefix / Scan | 65.2% | 50.0% | 6m |
| 29 | Divide Two Integers | Medium | Core DSA | Implementation / Reasoning | 19.8% | 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 |
| 94 | Binary Tree Inorder Traversal | Easy | Trees | DFS / BFS | 80.1% | 50.0% | all |
| 134 | Gas Station | Medium | Greedy | Greedy | 48.0% | 50.0% | all |
| 136 | Single Number | Easy | Core DSA | Implementation / Reasoning | 77.7% | 50.0% | all |
| 160 | Intersection of Two Linked Lists | Easy | Linked List | Two Pointers | 63.7% | 50.0% | all |
| 213 | House Robber II | Medium | Dynamic Programming | State Transition | 44.9% | 50.0% | all |
| 237 | Delete Node in a Linked List | Medium | Trees; Linked List | DFS / BFS; Two Pointers | 83.9% | 50.0% | all |
| 258 | Add Digits | Easy | Core DSA | Implementation / Reasoning | 68.9% | 50.0% | all |
| 1466 | Reorder Routes to Make All Paths Lead to the City Zero | Medium | Core DSA | Implementation / Reasoning | 65.8% | 50.0% | all |
| 1539 | Kth Missing Positive Number | Easy | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 63.5% | 50.0% | all |
| 2246 | Longest Path With Different Adjacent Characters | Hard | Strings | Hashing / Sliding Window | 54.0% | 50.0% | all |
| 383 | Ransom Note | Easy | Core DSA | Implementation / Reasoning | 66.0% | 50.0% | all |
| 4 | Median of Two Sorted Arrays | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 46.6% | 37.5% | 3m |
| 9 | Palindrome Number | Easy | Strings | Hashing / Sliding Window | 60.6% | 37.5% | 3m |
| 21 | Merge Two Sorted Lists | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 68.3% | 37.5% | 3m |
| 238 | Product of Array Except Self | Medium | Arrays | Sorting / Prefix / Scan | 68.9% | 37.5% | 3m |
| 2571 | Minimum Operations to Reduce an Integer to 0 | Medium | Arrays | Sorting / Prefix / Scan | 62.4% | 37.5% | 3m |
| 210 | Course Schedule II | Medium | Graphs | BFS / DFS / Topological Sort | 55.5% | 37.5% | 3m |
| 100 | Same Tree | Easy | Trees | DFS / BFS | 67.1% | 37.5% | 3m |
| 207 | Course Schedule | Medium | Graphs | BFS / DFS / Topological Sort | 51.4% | 37.5% | 3m |
| 27 | Remove Element | Easy | Core DSA | Implementation / Reasoning | 61.8% | 37.5% | 3m |
| 143 | Reorder List | Medium | Linked List | Two Pointers | 65.3% | 37.5% | 3m |
| 545 | Boundary of Binary Tree | Medium | Trees | DFS / BFS | 48.1% | 37.5% | 3m |
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 37.5% | 3m |
| 103 | Binary Tree Zigzag Level Order Traversal | Medium | Trees | DFS / BFS | 63.7% | 37.5% | 3m |
| 680 | Valid Palindrome II | Easy | Strings | Hashing / Sliding Window | 44.3% | 37.5% | 3m |
| 84 | Largest Rectangle in Histogram | Hard | Core DSA | Implementation / Reasoning | 49.9% | 37.5% | 3m |
| 622 | Design Circular Queue | Medium | Stack / Queue; Design | Monotonic Stack / Simulation; Data Structure Design | 54.7% | 37.5% | 3m |
| 543 | Diameter of Binary Tree | Easy | Trees | DFS / BFS | 65.5% | 37.5% | 3m |
| 2385 | Amount of Time for Binary Tree to Be Infected | Medium | Trees | DFS / BFS | 65.4% | 37.5% | 3m |
| 197 | Rising Temperature | Easy | Core DSA | Implementation / Reasoning | 51.3% | 37.5% | 3m |
| 72 | Edit Distance | Medium | Dynamic Programming | State Transition | 60.6% | 37.5% | 3m |
| 208 | Implement Trie (Prefix Tree) | Medium | Trees | DFS / BFS | 69.5% | 37.5% | 3m |
| 1461 | Check If a String Contains All Binary Codes of Size K | Medium | Strings | Hashing / Sliding Window | 61.6% | 37.5% | 3m |
| 334 | Increasing Triplet Subsequence | Medium | Core DSA | Implementation / Reasoning | 39.4% | 37.5% | 3m |
| 35 | Search Insert Position | Easy | Binary Search | Binary Search | 51.3% | 37.5% | 3m |
| 1980 | Find Unique Binary String | Medium | Strings | Hashing / Sliding Window | 81.2% | 37.5% | 3m |
| 83 | Remove Duplicates from Sorted List | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 56.7% | 37.5% | 3m |
| 2977 | Minimum Cost to Convert String II | Hard | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 59.6% | 37.5% | 3m |
| 678 | Valid Parenthesis String | Medium | Strings | Hashing / Sliding Window | 40.1% | 37.5% | 3m |
| 1727 | Largest Submatrix With Rearrangements | Medium | Arrays | Sorting / Prefix / Scan | 80.2% | 37.5% | 3m |
| 131 | Palindrome Partitioning | Medium | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 74.1% | 37.5% | 3m |
| 628 | Maximum Product of Three Numbers | Easy | Arrays | Sorting / Prefix / Scan | 45.9% | 37.5% | 3m |
| 2050 | Parallel Courses III | Hard | Graphs | BFS / DFS / Topological Sort | 66.8% | 37.5% | 3m |
| 2840 | Check if Strings Can be Made Equal With Operations II | Medium | Strings | Hashing / Sliding Window | 74.0% | 37.5% | 3m |
| 399 | Evaluate Division | Medium | Core DSA | Implementation / Reasoning | 64.2% | 37.5% | 3m |
| 1552 | Magnetic Force Between Two Balls | Medium | Core DSA | Implementation / Reasoning | 72.1% | 37.5% | 3m |
| 829 | Consecutive Numbers Sum | Hard | Arrays | Sorting / Prefix / Scan | 42.7% | 37.5% | 3m |
| 392 | Is Subsequence | Easy | Core DSA | Implementation / Reasoning | 49.0% | 37.5% | 3m |
| 658 | Find K Closest Elements | Medium | Core DSA | Implementation / Reasoning | 49.7% | 37.5% | 3m |
| 3418 | Maximum Amount of Money Robot Can Earn | Medium | Arrays | Sorting / Prefix / Scan | 47.8% | 37.5% | 3m |
| 570 | Managers with at Least 5 Direct Reports | Medium | Core DSA | Implementation / Reasoning | 49.0% | 37.5% | 3m |
| 79 | Word Search | Medium | Strings; Binary Search | Hashing / Sliding Window; Binary Search | 47.4% | 37.5% | 3m |
| 443 | String Compression | Medium | Strings | Hashing / Sliding Window | 60.0% | 37.5% | 3m |
| 132 | Palindrome Partitioning II | Hard | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 37.1% | 37.5% | 3m |
| 1752 | Check if Array Is Sorted and Rotated | Easy | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 57.2% | 37.5% | 3m |
| 1838 | Frequency of the Most Frequent Element | Medium | Core DSA | Implementation / Reasoning | 44.8% | 37.5% | 3m |
| 310 | Minimum Height Trees | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 42.6% | 37.5% | 3m |
| 98 | Validate Binary Search Tree | Medium | Strings; Trees; Binary Search | Hashing / Sliding Window; DFS / BFS; Binary Search | 35.8% | 37.5% | 3m |
| 69 | Sqrt(x) | Easy | Binary Search | Binary Search | 41.8% | 37.5% | 3m |
| 3741 | Minimum Distance Between Three Equal Elements II | Medium | Arrays | Sorting / Prefix / Scan | 74.8% | 37.5% | 3m |
| 329 | Longest Increasing Path in a Matrix | Hard | Arrays; Dynamic Programming | Sorting / Prefix / Scan; State Transition | 56.6% | 37.5% | 3m |
| 140 | Word Break II | Hard | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 55.6% | 37.5% | 3m |
| 66 | Plus One | Easy | Core DSA | Implementation / Reasoning | 50.0% | 37.5% | 3m |
| 181 | Employees Earning More Than Their Managers | Easy | Core DSA | Implementation / Reasoning | 73.2% | 37.5% | 3m |
| 584 | Find Customer Referee | Easy | Core DSA | Implementation / Reasoning | 72.9% | 37.5% | 3m |
| 1280 | Students and Examinations | Easy | Core DSA | Implementation / Reasoning | 61.2% | 37.5% | 3m |
| 3546 | Equal Sum Grid Partition I | Medium | Arrays; Dynamic Programming | Sorting / Prefix / Scan; State Transition | 52.9% | 37.5% | 3m |
| 621 | Task Scheduler | Medium | Greedy | Greedy | 63.1% | 37.5% | 3m |
| 752 | Open the Lock | Medium | Core DSA | Implementation / Reasoning | 61.3% | 37.5% | 3m |
| 196 | Delete Duplicate Emails | Easy | Arrays | Sorting / Prefix / Scan | 66.0% | 37.5% | 3m |
| 344 | Reverse String | Easy | Strings | Hashing / Sliding Window | 80.8% | 37.5% | 3m |
| 827 | Making A Large Island | Hard | Graphs | BFS / DFS / Topological Sort | 56.6% | 37.5% | 3m |
| 2906 | Construct Product Matrix | Medium | Arrays | Sorting / Prefix / Scan | 51.7% | 37.5% | 3m |
| 407 | Trapping Rain Water II | Hard | Core DSA | Two Pointers | 64.1% | 37.5% | 3m |
| 3742 | Maximum Path Score in a Grid | Medium | Arrays | Sorting / Prefix / Scan | 53.9% | 37.5% | 3m |
| 36 | Valid Sudoku | Medium | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 64.5% | 37.5% | 3m |
| 404 | Sum of Left Leaves | Easy | Arrays | Sorting / Prefix / Scan | 62.7% | 37.5% | 3m |
| 204 | Count Primes | Medium | Core DSA | Implementation / Reasoning | 36.1% | 37.5% | 3m |
| 1979 | Find Greatest Common Divisor of Array | Easy | Arrays | Sorting / Prefix / Scan | 80.0% | 37.5% | 3m |
| 992 | Subarrays with K Different Integers | Hard | Arrays | Sorting / Prefix / Scan | 68.1% | 37.5% | 3m |
| 428 | Serialize and Deserialize N-ary Tree | Hard | Trees; Design | DFS / BFS; Data Structure Design | 68.8% | 37.5% | 3m |
| 907 | Sum of Subarray Minimums | Medium | Arrays | Sorting / Prefix / Scan | 38.6% | 37.5% | 3m |
| 274 | H-Index | Medium | Core DSA | Implementation / Reasoning | 41.4% | 37.5% | 3m |
| 987 | Vertical Order Traversal of a Binary Tree | Hard | Trees | DFS / BFS | 53.8% | 37.5% | 3m |
| 868 | Binary Gap | Easy | Core DSA | Implementation / Reasoning | 74.3% | 37.5% | 3m |
| 1193 | Monthly Transactions I | Medium | Core DSA | Implementation / Reasoning | 59.2% | 37.5% | 3m |
| 1928 | Minimum Cost to Reach Destination in Time | Hard | Arrays | Sorting / Prefix / Scan | 41.6% | 37.5% | 3m |
| 704 | Binary Search | Easy | Binary Search | Binary Search | 60.9% | 37.5% | 3m |