2274 curated coding interview questions directly asked in Google technical rounds, sorted by frequency with recency and difficulty diagnostics.
Showing top 200 of 2274 questions. View all 2274 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 |
| 1929 | Concatenation of Array | Easy | Arrays | Sorting / Prefix / Scan | 90.3% | 75.0% | 30d |
| 9 | Palindrome Number | Easy | Strings | Hashing / Sliding Window | 60.6% | 62.5% | 30d |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 62.5% | 30d |
| 15 | 3Sum | Medium | Arrays | Sorting / Prefix / Scan | 39.1% | 62.5% | 30d |
| 2 | Add Two Numbers | Medium | Core DSA | Implementation / Reasoning | 48.5% | 62.5% | 30d |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 62.5% | 30d |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 62.5% | 30d |
| 128 | Longest Consecutive Sequence | Medium | Core DSA | Implementation / Reasoning | 47.1% | 62.5% | 30d |
| 1768 | Merge Strings Alternately | Easy | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 82.1% | 62.5% | 30d |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 62.5% | 30d |
| 253 | Meeting Rooms II | Medium | Greedy | Greedy | 52.7% | 62.5% | 30d |
| 14 | Longest Common Prefix | Easy | Core DSA | Implementation / Reasoning | 47.6% | 62.5% | 3m |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 62.5% | 3m |
| 1526 | Minimum Number of Increments on Subarrays to Form a Target Array | Hard | Arrays | Sorting / Prefix / Scan | 78.2% | 62.5% | all |
| 4 | Median of Two Sorted Arrays | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 46.6% | 50.0% | 30d |
| 11 | Container With Most Water | Medium | Core DSA | Two Pointers | 60.0% | 50.0% | 30d |
| 13 | Roman to Integer | Easy | Strings | Hashing / Sliding Window | 66.6% | 50.0% | 30d |
| 175 | Combine Two Tables | Easy | Core DSA | Implementation / Reasoning | 79.5% | 50.0% | 30d |
| 875 | Koko Eating Bananas | Medium | Binary Search | Binary Search | 50.0% | 50.0% | 30d |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 50.0% | 30d |
| 31 | Next Permutation | Medium | Backtracking | Backtracking | 45.3% | 50.0% | 30d |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 50.0% | 30d |
| 88 | Merge Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 54.9% | 50.0% | 30d |
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 50.0% | 30d |
| 876 | Middle of the Linked List | Easy | Linked List | Two Pointers | 81.8% | 50.0% | 30d |
| 2667 | Create Hello World Function | Easy | Core DSA | Implementation / Reasoning | 81.9% | 50.0% | 30d |
| 26 | Remove Duplicates from Sorted Array | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 62.8% | 50.0% | 30d |
| 1148 | Article Views I | Easy | Core DSA | Implementation / Reasoning | 76.6% | 50.0% | 30d |
| 21 | Merge Two Sorted Lists | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 68.3% | 50.0% | 30d |
| 204 | Count Primes | Medium | Core DSA | Implementation / Reasoning | 36.1% | 50.0% | 30d |
| 344 | Reverse String | Easy | Strings | Hashing / Sliding Window | 80.8% | 50.0% | 30d |
| 485 | Max Consecutive Ones | Easy | Core DSA | Implementation / Reasoning | 65.2% | 50.0% | 30d |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 50.0% | 30d |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 50.0% | 30d |
| 109 | Convert Sorted List to Binary Search Tree | Medium | Arrays; Trees; Linked List; Binary Search | Sorting / Prefix / Scan; DFS / BFS; Two Pointers; Binary Search | 66.6% | 50.0% | 30d |
| 3225 | Maximum Score From Grid Operations | Hard | Arrays | Sorting / Prefix / Scan | 64.5% | 50.0% | 30d |
| 3742 | Maximum Path Score in a Grid | Medium | Arrays | Sorting / Prefix / Scan | 53.9% | 50.0% | 30d |
| 1581 | Customer Who Visited but Did Not Make Any Transactions | Easy | Core DSA | Implementation / Reasoning | 67.7% | 50.0% | 30d |
| 295 | Find Median from Data Stream | Hard | Heap | Priority Queue | 54.5% | 50.0% | 30d |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 50.0% | 30d |
| 796 | Rotate String | Easy | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 66.6% | 50.0% | 30d |
| 496 | Next Greater Element I | Easy | Stack / Queue | Monotonic Stack / Simulation | 76.1% | 50.0% | 30d |
| 217 | Contains Duplicate | Easy | Arrays | Sorting / Prefix / Scan | 64.4% | 50.0% | 30d |
| 215 | Kth Largest Element in an Array | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 68.9% | 50.0% | 30d |
| 61 | Rotate List | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 42.6% | 50.0% | 30d |
| 7 | Reverse Integer | Medium | Core DSA | Implementation / Reasoning | 31.9% | 50.0% | 30d |
| 1838 | Frequency of the Most Frequent Element | Medium | Core DSA | Implementation / Reasoning | 44.8% | 50.0% | 30d |
| 29 | Divide Two Integers | Medium | Core DSA | Implementation / Reasoning | 19.8% | 50.0% | 30d |
| 931 | Minimum Falling Path Sum | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 60.8% | 50.0% | 30d |
| 3629 | Minimum Jumps to Reach End via Prime Teleportation | Medium | Arrays; Greedy | Sorting / Prefix / Scan; Greedy | 44.8% | 50.0% | 30d |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 50.0% | 30d |
| 202 | Happy Number | Easy | Core DSA | Implementation / Reasoning | 59.7% | 50.0% | 30d |
| 1665 | Minimum Initial Energy to Finish Tasks | Hard | Arrays | Sorting / Prefix / Scan | 76.4% | 50.0% | 30d |
| 2784 | Check if Array is Good | Easy | Arrays | Sorting / Prefix / Scan | 57.3% | 50.0% | 30d |
| 238 | Product of Array Except Self | Medium | Arrays | Sorting / Prefix / Scan | 68.9% | 50.0% | 30d |
| 410 | Split Array Largest Sum | Hard | Arrays | Sorting / Prefix / Scan | 60.4% | 50.0% | 30d |
| 100 | Same Tree | Easy | Trees | DFS / BFS | 67.1% | 50.0% | 30d |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | Trees | DFS / BFS | 68.8% | 50.0% | 30d |
| 169 | Majority Element | Easy | Core DSA | Implementation / Reasoning | 66.3% | 50.0% | 30d |
| 55 | Jump Game | Medium | Greedy | Greedy | 40.9% | 50.0% | 30d |
| 2657 | Find the Prefix Common Array of Two Arrays | Medium | Arrays | Sorting / Prefix / Scan | 88.3% | 50.0% | 30d |
| 3043 | Find the Length of the Longest Common Prefix | Medium | Core DSA | Implementation / Reasoning | 62.2% | 50.0% | 30d |
| 18 | 4Sum | Medium | Arrays | Sorting / Prefix / Scan | 40.6% | 50.0% | 3m |
| 75 | Sort Colors | Medium | Arrays | Sorting / Prefix / Scan | 69.6% | 50.0% | 3m |
| 206 | Reverse Linked List | Easy | Linked List | Two Pointers | 80.6% | 50.0% | 3m |
| 17 | Letter Combinations of a Phone Number | Medium | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 66.1% | 50.0% | 3m |
| 2235 | Add Two Integers | Easy | Core DSA | Implementation / Reasoning | 88.0% | 50.0% | 3m |
| 354 | Russian Doll Envelopes | Hard | Core DSA | Implementation / Reasoning | 37.9% | 50.0% | 3m |
| 283 | Move Zeroes | Easy | Core DSA | Two Pointers | 63.8% | 50.0% | 3m |
| 167 | Two Sum II - Input Array Is Sorted | Medium | Arrays | Sorting / Prefix / Scan; Two Pointers | 65.1% | 50.0% | 3m |
| 349 | Intersection of Two Arrays | Easy | Arrays | Sorting / Prefix / Scan | 77.8% | 50.0% | 3m |
| 74 | Search a 2D Matrix | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 53.9% | 50.0% | 3m |
| 1502 | Can Make Arithmetic Progression From Sequence | Easy | Core DSA | Implementation / Reasoning | 68.9% | 50.0% | 3m |
| 503 | Next Greater Element II | Medium | Stack / Queue | Monotonic Stack / Simulation | 68.4% | 50.0% | 3m |
| 155 | Min Stack | Medium | Stack / Queue | Monotonic Stack / Simulation | 58.2% | 50.0% | 3m |
| 1825 | Finding MK Average | Hard | Core DSA | Implementation / Reasoning | 38.7% | 50.0% | all |
| 2995 | Viewers Turned Streamers | Hard | Core DSA | Implementation / Reasoning | 42.9% | 50.0% | all |
| 3355 | Zero Array Transformation I | Medium | Arrays | Sorting / Prefix / Scan | 54.5% | 50.0% | all |
| 3623 | Count Number of Trapezoids I | Medium | Core DSA | Implementation / Reasoning | 48.1% | 50.0% | all |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 37.5% | 30d |
| 46 | Permutations | Medium | Backtracking | Backtracking | 81.9% | 37.5% | 30d |
| 300 | Longest Increasing Subsequence | Medium | Dynamic Programming | State Transition | 59.4% | 37.5% | 30d |
| 27 | Remove Element | Easy | Core DSA | Implementation / Reasoning | 61.8% | 37.5% | 30d |
| 1757 | Recyclable and Low Fat Products | Easy | Arrays | Sorting / Prefix / Scan | 88.6% | 37.5% | 30d |
| 645 | Set Mismatch | Easy | Core DSA | Implementation / Reasoning | 43.6% | 37.5% | 30d |
| 12 | Integer to Roman | Medium | Strings | Hashing / Sliding Window | 71.0% | 37.5% | 30d |
| 68 | Text Justification | Hard | Core DSA | Implementation / Reasoning | 51.2% | 37.5% | 30d |
| 287 | Find the Duplicate Number | Medium | Arrays | Sorting / Prefix / Scan | 64.3% | 37.5% | 30d |
| 977 | Squares of a Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 73.8% | 37.5% | 30d |
| 3464 | Maximize the Distance Between Points on a Square | Hard | Core DSA | Implementation / Reasoning | 51.1% | 37.5% | 30d |
| 1296 | Divide Array in Sets of K Consecutive Numbers | Medium | Arrays | Sorting / Prefix / Scan | 59.3% | 37.5% | 30d |
| 1391 | Check if There is a Valid Path in a Grid | Medium | Strings | Hashing / Sliding Window | 64.5% | 37.5% | 30d |
| 118 | Pascal's Triangle | Easy | Core DSA | Implementation / Reasoning | 78.9% | 37.5% | 30d |
| 396 | Rotate Function | Medium | Arrays | Sorting / Prefix / Scan | 54.1% | 37.5% | 30d |
| 22 | Generate Parentheses | Medium | Strings | Hashing / Sliding Window | 78.7% | 37.5% | 30d |
| 907 | Sum of Subarray Minimums | Medium | Arrays | Sorting / Prefix / Scan | 38.6% | 37.5% | 30d |
| 788 | Rotated Digits | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 64.0% | 37.5% | 30d |
| 70 | Climbing Stairs | Easy | Dynamic Programming | State Transition | 54.1% | 37.5% | 30d |
| 595 | Big Countries | Easy | Trees | DFS / BFS | 68.5% | 37.5% | 30d |
| 2877 | Create a DataFrame from List | Easy | Linked List | Two Pointers | 81.0% | 37.5% | 30d |
| 1944 | Number of Visible People in a Queue | Hard | Stack / Queue | Monotonic Stack / Simulation | 73.1% | 37.5% | 30d |
| 1861 | Rotating the Box | Medium | Core DSA | Implementation / Reasoning | 82.5% | 37.5% | 30d |
| 213 | House Robber II | Medium | Dynamic Programming | State Transition | 44.9% | 37.5% | 30d |
| 1321 | Restaurant Growth | Medium | Core DSA | Implementation / Reasoning | 58.8% | 37.5% | 30d |
| 3660 | Jump Game IX | Medium | Greedy | Greedy | 46.2% | 37.5% | 30d |
| 345 | Reverse Vowels of a String | Easy | Strings | Hashing / Sliding Window | 61.3% | 37.5% | 30d |
| 1914 | Cyclically Rotating a Grid | Medium | Core DSA | Implementation / Reasoning | 74.1% | 37.5% | 30d |
| 189 | Rotate Array | Medium | Arrays | Sorting / Prefix / Scan | 44.9% | 37.5% | 30d |
| 577 | Employee Bonus | Easy | Core DSA | Implementation / Reasoning | 77.4% | 37.5% | 30d |
| 2553 | Separate the Digits in an Array | Easy | Arrays | Sorting / Prefix / Scan | 85.8% | 37.5% | 30d |
| 168 | Excel Sheet Column Title | Easy | Core DSA | Implementation / Reasoning | 46.5% | 37.5% | 30d |
| 1109 | Corporate Flight Bookings | Medium | Core DSA | Implementation / Reasoning | 67.3% | 37.5% | 30d |
| 1004 | Max Consecutive Ones III | Medium | Core DSA | Implementation / Reasoning | 67.7% | 37.5% | 30d |
| 777 | Swap Adjacent in LR String | Medium | Strings | Hashing / Sliding Window | 38.1% | 37.5% | 30d |
| 1674 | Minimum Moves to Make Array Complementary | Medium | Arrays | Sorting / Prefix / Scan | 65.0% | 37.5% | 30d |
| 815 | Bus Routes | Hard | Core DSA | Implementation / Reasoning | 47.3% | 37.5% | 30d |
| 67 | Add Binary | Easy | Core DSA | Implementation / Reasoning | 58.1% | 37.5% | 30d |
| 231 | Power of Two | Easy | Core DSA | Implementation / Reasoning | 50.1% | 37.5% | 30d |
| 703 | Kth Largest Element in a Stream | Easy | Heap | Priority Queue | 61.0% | 37.5% | 30d |
| 48 | Rotate Image | Medium | Arrays | Sorting / Prefix / Scan | 80.1% | 37.5% | 30d |
| 394 | Decode String | Medium | Strings; Dynamic Programming; Stack / Queue | Hashing / Sliding Window; State Transition; Monotonic Stack / Simulation | 62.6% | 37.5% | 30d |
| 197 | Rising Temperature | Easy | Core DSA | Implementation / Reasoning | 51.3% | 37.5% | 30d |
| 542 | 01 Matrix | Medium | Arrays | Sorting / Prefix / Scan | 53.9% | 37.5% | 30d |
| 45 | Jump Game II | Medium | Greedy | Greedy | 42.9% | 37.5% | 30d |
| 3481 | Apply Substitutions | Medium | Trees | DFS / BFS | 77.4% | 37.5% | 30d |
| 125 | Valid Palindrome | Easy | Strings | Hashing / Sliding Window | 53.3% | 37.5% | 30d |
| 509 | Fibonacci Number | Easy | Core DSA | Implementation / Reasoning | 74.1% | 37.5% | 30d |
| 258 | Add Digits | Easy | Core DSA | Implementation / Reasoning | 68.9% | 37.5% | 30d |
| 1345 | Jump Game IV | Hard | Greedy | Greedy | 51.0% | 37.5% | 30d |
| 1539 | Kth Missing Positive Number | Easy | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 63.5% | 37.5% | 30d |
| 207 | Course Schedule | Medium | Graphs | BFS / DFS / Topological Sort | 51.4% | 37.5% | 30d |
| 274 | H-Index | Medium | Core DSA | Implementation / Reasoning | 41.4% | 37.5% | 30d |
| 25 | Reverse Nodes in k-Group | Hard | Trees; Linked List | DFS / BFS; Two Pointers | 66.1% | 37.5% | 30d |
| 242 | Valid Anagram | Easy | Strings | Hashing / Sliding Window | 68.1% | 37.5% | 30d |
| 621 | Task Scheduler | Medium | Greedy | Greedy | 63.1% | 37.5% | 30d |
| 359 | Logger Rate Limiter | Easy | Design | Data Structure Design | 76.8% | 37.5% | 30d |
| 69 | Sqrt(x) | Easy | Binary Search | Binary Search | 41.8% | 37.5% | 30d |
| 424 | Longest Repeating Character Replacement | Medium | Strings | Hashing / Sliding Window | 59.7% | 37.5% | 30d |
| 58 | Length of Last Word | Easy | Strings | Hashing / Sliding Window | 58.8% | 37.5% | 30d |
| 540 | Single Element in a Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 59.3% | 37.5% | 30d |
| 680 | Valid Palindrome II | Easy | Strings | Hashing / Sliding Window | 44.3% | 37.5% | 30d |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 37.5% | 30d |
| 28 | Find the Index of the First Occurrence in a String | Easy | Strings | Hashing / Sliding Window | 46.7% | 37.5% | 30d |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 37.5% | 30d |
| 6 | Zigzag Conversion | Medium | Core DSA | Implementation / Reasoning | 54.2% | 37.5% | 3m |
| 35 | Search Insert Position | Easy | Binary Search | Binary Search | 51.3% | 37.5% | 3m |
| 41 | First Missing Positive | Hard | Arrays | Sorting / Prefix / Scan | 42.9% | 37.5% | 3m |
| 51 | N-Queens | Hard | Backtracking | Backtracking | 75.5% | 37.5% | 3m |
| 62 | Unique Paths | Medium | Core DSA | Implementation / Reasoning | 66.8% | 37.5% | 3m |
| 66 | Plus One | Easy | Core DSA | Implementation / Reasoning | 50.0% | 37.5% | 3m |
| 136 | Single Number | Easy | Core DSA | Implementation / Reasoning | 77.7% | 37.5% | 3m |
| 322 | Coin Change | Medium | Dynamic Programming | State Transition | 48.4% | 37.5% | 3m |
| 151 | Reverse Words in a String | Medium | Strings | Hashing / Sliding Window | 56.4% | 37.5% | 3m |
| 10 | Regular Expression Matching | Hard | Core DSA | Implementation / Reasoning | 31.0% | 37.5% | 3m |
| 162 | Find Peak Element | Medium | Binary Search | Binary Search | 47.0% | 37.5% | 3m |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 37.5% | 3m |
| 19 | Remove Nth Node From End of List | Medium | Trees; Linked List | DFS / BFS; Two Pointers | 51.6% | 37.5% | 3m |
| 73 | Set Matrix Zeroes | Medium | Arrays | Sorting / Prefix / Scan | 62.9% | 37.5% | 3m |
| 130 | Surrounded Regions | Medium | Core DSA | Implementation / Reasoning | 45.3% | 37.5% | 3m |
| 79 | Word Search | Medium | Strings; Binary Search | Hashing / Sliding Window; Binary Search | 47.4% | 37.5% | 3m |
| 234 | Palindrome Linked List | Easy | Strings; Linked List | Hashing / Sliding Window; Two Pointers | 58.0% | 37.5% | 3m |
| 704 | Binary Search | Easy | Binary Search | Binary Search | 60.9% | 37.5% | 3m |
| 205 | Isomorphic Strings | Easy | Strings | Hashing / Sliding Window | 48.4% | 37.5% | 3m |
| 102 | Binary Tree Level Order Traversal | Medium | Trees | DFS / BFS | 72.7% | 37.5% | 3m |
| 236 | Lowest Common Ancestor of a Binary Tree | Medium | Trees | DFS / BFS | 69.3% | 37.5% | 3m |
| 131 | Palindrome Partitioning | Medium | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 74.1% | 37.5% | 3m |
| 78 | Subsets | Medium | Backtracking | Backtracking | 82.3% | 37.5% | 3m |
| 912 | Sort an Array | Medium | Arrays | Sorting / Prefix / Scan | 55.9% | 37.5% | 3m |
| 448 | Find All Numbers Disappeared in an Array | Easy | Arrays | Sorting / Prefix / Scan | 64.1% | 37.5% | 3m |
| 141 | Linked List Cycle | Easy | Linked List | Two Pointers | 54.3% | 37.5% | 3m |
| 181 | Employees Earning More Than Their Managers | Easy | Core DSA | Implementation / Reasoning | 73.2% | 37.5% | 3m |
| 152 | Maximum Product Subarray | Medium | Arrays | Sorting / Prefix / Scan | 36.4% | 37.5% | 3m |
| 176 | Second Highest Salary | Medium | Core DSA | Implementation / Reasoning | 47.0% | 37.5% | 3m |
| 1480 | Running Sum of 1d Array | Easy | Arrays | Sorting / Prefix / Scan | 86.9% | 37.5% | 3m |
| 518 | Coin Change II | Medium | Dynamic Programming | State Transition | 60.0% | 37.5% | 3m |
| 83 | Remove Duplicates from Sorted List | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 56.7% | 37.5% | 3m |
| 80 | Remove Duplicates from Sorted Array II | Medium | Arrays | Sorting / Prefix / Scan; Two Pointers | 64.7% | 37.5% | 3m |
| 1094 | Car Pooling | Medium | Core DSA | Implementation / Reasoning | 56.4% | 37.5% | 3m |
| 383 | Ransom Note | Easy | Core DSA | Implementation / Reasoning | 66.0% | 37.5% | 3m |
| 127 | Word Ladder | Hard | Strings | Hashing / Sliding Window | 45.6% | 37.5% | 3m |
| 34 | Find First and Last Position of Element in Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 48.9% | 37.5% | 3m |
| 39 | Combination Sum | Medium | Arrays; Backtracking | Sorting / Prefix / Scan; Backtracking | 76.5% | 37.5% | 3m |
| 268 | Missing Number | Easy | Arrays | Sorting / Prefix / Scan | 72.0% | 37.5% | 3m |
| 32 | Longest Valid Parentheses | Hard | Strings | Hashing / Sliding Window | 38.8% | 37.5% | 3m |
| 179 | Largest Number | Medium | Core DSA | Implementation / Reasoning | 43.1% | 37.5% | 3m |
| 643 | Maximum Average Subarray I | Easy | Arrays | Sorting / Prefix / Scan | 47.8% | 37.5% | 3m |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 37.5% | 3m |
| 85 | Maximal Rectangle | Hard | Core DSA | Implementation / Reasoning | 58.8% | 37.5% | 3m |
| 224 | Basic Calculator | Hard | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 37.5% | 3m |
| 844 | Backspace String Compare | Easy | Strings | Hashing / Sliding Window | 49.9% | 37.5% | 3m |
| 2965 | Find Missing and Repeated Values | Easy | Arrays | Sorting / Prefix / Scan | 83.2% | 37.5% | 3m |
| 1470 | Shuffle the Array | Easy | Arrays | Sorting / Prefix / Scan | 88.8% | 37.5% | 3m |
| 24 | Swap Nodes in Pairs | Medium | Trees | DFS / BFS | 69.5% | 37.5% | 3m |
| 1075 | Project Employees I | Easy | Core DSA | Implementation / Reasoning | 66.8% | 37.5% | 3m |
| 547 | Number of Provinces | Medium | Core DSA | Implementation / Reasoning | 70.4% | 37.5% | 3m |
| 30 | Substring with Concatenation of All Words | Hard | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 34.4% | 37.5% | 3m |
| 662 | Maximum Width of Binary Tree | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 45.6% | 37.5% | 3m |
| 232 | Implement Queue using Stacks | Easy | Stack / Queue | Monotonic Stack / Simulation | 69.8% | 37.5% | 3m |
| 528 | Random Pick with Weight | Medium | Core DSA | Implementation / Reasoning | 49.1% | 37.5% | 3m |