1190 curated coding interview questions directly asked in Bloomberg technical rounds, sorted by frequency with recency and difficulty diagnostics.
Showing top 200 of 1190 questions. View all 1190 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 |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 100.0% | 30d |
| 424 | Longest Repeating Character Replacement | Medium | Strings | Hashing / Sliding Window | 59.7% | 87.5% | 30d |
| 380 | Insert Delete GetRandom O(1) | Medium | Core DSA | Implementation / Reasoning | 55.4% | 75.0% | 30d |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 75.0% | 30d |
| 253 | Meeting Rooms II | Medium | Greedy | Greedy | 52.7% | 75.0% | 30d |
| 796 | Rotate String | Easy | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 66.6% | 75.0% | 30d |
| 1752 | Check if Array Is Sorted and Rotated | Easy | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 57.2% | 75.0% | 30d |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 75.0% | 30d |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 75.0% | 30d |
| 22 | Generate Parentheses | Medium | Strings | Hashing / Sliding Window | 78.7% | 75.0% | 3m |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 75.0% | 3m |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 75.0% | 3m |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 75.0% | 3m |
| 79 | Word Search | Medium | Strings; Binary Search | Hashing / Sliding Window; Binary Search | 47.4% | 75.0% | 3m |
| 21 | Merge Two Sorted Lists | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 68.3% | 75.0% | 3m |
| 70 | Climbing Stairs | Easy | Dynamic Programming | State Transition | 54.1% | 75.0% | 3m |
| 15 | 3Sum | Medium | Arrays | Sorting / Prefix / Scan | 39.1% | 75.0% | 3m |
| 128 | Longest Consecutive Sequence | Medium | Core DSA | Implementation / Reasoning | 47.1% | 75.0% | 3m |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 62.5% | 30d |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 62.5% | 30d |
| 394 | Decode String | Medium | Strings; Dynamic Programming; Stack / Queue | Hashing / Sliding Window; State Transition; Monotonic Stack / Simulation | 62.6% | 62.5% | 30d |
| 2833 | Furthest Point From Origin | Easy | Core DSA | Implementation / Reasoning | 77.0% | 62.5% | 30d |
| 139 | Word Break | Medium | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 49.5% | 62.5% | 30d |
| 430 | Flatten a Multilevel Doubly Linked List | Medium | Linked List | Two Pointers | 62.9% | 62.5% | 30d |
| 48 | Rotate Image | Medium | Arrays | Sorting / Prefix / Scan | 80.1% | 62.5% | 30d |
| 30 | Substring with Concatenation of All Words | Hard | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 34.4% | 62.5% | 30d |
| 75 | Sort Colors | Medium | Arrays | Sorting / Prefix / Scan | 69.6% | 62.5% | 30d |
| 933 | Number of Recent Calls | Easy | Core DSA | Implementation / Reasoning | 78.5% | 62.5% | 30d |
| 125 | Valid Palindrome | Easy | Strings | Hashing / Sliding Window | 53.3% | 62.5% | 30d |
| 14 | Longest Common Prefix | Easy | Core DSA | Implementation / Reasoning | 47.6% | 62.5% | 30d |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 62.5% | 30d |
| 4 | Median of Two Sorted Arrays | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 46.6% | 62.5% | 3m |
| 26 | Remove Duplicates from Sorted Array | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 62.8% | 62.5% | 3m |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 62.5% | 3m |
| 1396 | Design Underground System | Medium | Design | Data Structure Design | 74.5% | 62.5% | 3m |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 62.5% | 3m |
| 1169 | Invalid Transactions | Medium | Strings | Hashing / Sliding Window | 32.3% | 62.5% | 3m |
| 242 | Valid Anagram | Easy | Strings | Hashing / Sliding Window | 68.1% | 62.5% | 3m |
| 283 | Move Zeroes | Easy | Core DSA | Two Pointers | 63.8% | 62.5% | 3m |
| 322 | Coin Change | Medium | Dynamic Programming | State Transition | 48.4% | 62.5% | 3m |
| 50 | Pow(x, n) | Medium | Core DSA | Implementation / Reasoning | 38.7% | 62.5% | 3m |
| 88 | Merge Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 54.9% | 62.5% | 3m |
| 1274 | Number of Ships in a Rectangle | Hard | Binary Search | Binary Search | 68.9% | 62.5% | 3m |
| 69 | Sqrt(x) | Easy | Binary Search | Binary Search | 41.8% | 62.5% | 3m |
| 18 | 4Sum | Medium | Arrays | Sorting / Prefix / Scan | 40.6% | 62.5% | 3m |
| 27 | Remove Element | Easy | Core DSA | Implementation / Reasoning | 61.8% | 62.5% | 3m |
| 875 | Koko Eating Bananas | Medium | Binary Search | Binary Search | 50.0% | 62.5% | 3m |
| 387 | First Unique Character in a String | Easy | Strings | Hashing / Sliding Window | 65.5% | 62.5% | 3m |
| 2667 | Create Hello World Function | Easy | Core DSA | Implementation / Reasoning | 81.9% | 62.5% | 3m |
| 138 | Copy List with Random Pointer | Medium | Linked List | Two Pointers | 62.9% | 62.5% | 3m |
| 344 | Reverse String | Easy | Strings | Hashing / Sliding Window | 80.8% | 62.5% | 3m |
| 35 | Search Insert Position | Easy | Binary Search | Binary Search | 51.3% | 62.5% | 3m |
| 236 | Lowest Common Ancestor of a Binary Tree | Medium | Trees | DFS / BFS | 69.3% | 62.5% | 3m |
| 1249 | Minimum Remove to Make Valid Parentheses | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 71.5% | 62.5% | 6m |
| 152 | Maximum Product Subarray | Medium | Arrays | Sorting / Prefix / Scan | 36.4% | 62.5% | 6m |
| 1209 | Remove All Adjacent Duplicates in String II | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 61.3% | 62.5% | 6m |
| 2423 | Remove Letter To Equalize Frequency | Easy | Strings | Hashing / Sliding Window | 19.4% | 62.5% | 6m |
| 445 | Add Two Numbers II | Medium | Core DSA | Implementation / Reasoning | 62.6% | 62.5% | 6m |
| 131 | Palindrome Partitioning | Medium | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 74.1% | 62.5% | all |
| 9 | Palindrome Number | Easy | Strings | Hashing / Sliding Window | 60.6% | 50.0% | 3m |
| 13 | Roman to Integer | Easy | Strings | Hashing / Sliding Window | 66.6% | 50.0% | 3m |
| 140 | Word Break II | Hard | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 55.6% | 50.0% | 3m |
| 399 | Evaluate Division | Medium | Core DSA | Implementation / Reasoning | 64.2% | 50.0% | 3m |
| 155 | Min Stack | Medium | Stack / Queue | Monotonic Stack / Simulation | 58.2% | 50.0% | 3m |
| 1387 | Sort Integers by The Power Value | Medium | Arrays | Sorting / Prefix / Scan | 71.7% | 50.0% | 3m |
| 797 | All Paths From Source to Target | Medium | Core DSA | Implementation / Reasoning | 83.6% | 50.0% | 3m |
| 496 | Next Greater Element I | Easy | Stack / Queue | Monotonic Stack / Simulation | 76.1% | 50.0% | 3m |
| 1244 | Design A Leaderboard | Medium | Design | Data Structure Design | 68.1% | 50.0% | 3m |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 50.0% | 3m |
| 1656 | Design an Ordered Stream | Easy | Design | Data Structure Design | 82.7% | 50.0% | 3m |
| 127 | Word Ladder | Hard | Strings | Hashing / Sliding Window | 45.6% | 50.0% | 3m |
| 17 | Letter Combinations of a Phone Number | Medium | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 66.1% | 50.0% | 3m |
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 50.0% | 3m |
| 1583 | Count Unhappy Friends | Medium | Core DSA | Implementation / Reasoning | 62.5% | 50.0% | 3m |
| 217 | Contains Duplicate | Easy | Arrays | Sorting / Prefix / Scan | 64.4% | 50.0% | 3m |
| 167 | Two Sum II - Input Array Is Sorted | Medium | Arrays | Sorting / Prefix / Scan; Two Pointers | 65.1% | 50.0% | 3m |
| 234 | Palindrome Linked List | Easy | Strings; Linked List | Hashing / Sliding Window; Two Pointers | 58.0% | 50.0% | 3m |
| 1029 | Two City Scheduling | Medium | Core DSA | Implementation / Reasoning | 68.5% | 50.0% | 3m |
| 101 | Symmetric Tree | Easy | Trees | DFS / BFS | 61.2% | 50.0% | 3m |
| 73 | Set Matrix Zeroes | Medium | Arrays | Sorting / Prefix / Scan | 62.9% | 50.0% | 3m |
| 134 | Gas Station | Medium | Greedy | Greedy | 48.0% | 50.0% | 3m |
| 543 | Diameter of Binary Tree | Easy | Trees | DFS / BFS | 65.5% | 50.0% | 3m |
| 189 | Rotate Array | Medium | Arrays | Sorting / Prefix / Scan | 44.9% | 50.0% | 3m |
| 45 | Jump Game II | Medium | Greedy | Greedy | 42.9% | 50.0% | 3m |
| 130 | Surrounded Regions | Medium | Core DSA | Implementation / Reasoning | 45.3% | 50.0% | 3m |
| 3488 | Closest Equal Element Queries | Medium | Core DSA | Implementation / Reasoning | 51.4% | 50.0% | 3m |
| 118 | Pascal's Triangle | Easy | Core DSA | Implementation / Reasoning | 78.9% | 50.0% | 3m |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 50.0% | 3m |
| 904 | Fruit Into Baskets | Medium | Core DSA | Implementation / Reasoning | 51.1% | 50.0% | 3m |
| 31 | Next Permutation | Medium | Backtracking | Backtracking | 45.3% | 50.0% | 3m |
| 23 | Merge k Sorted Lists | Hard | Arrays; Linked List; Heap | Sorting / Prefix / Scan; Two Pointers; Priority Queue | 59.6% | 50.0% | 6m |
| 143 | Reorder List | Medium | Linked List | Two Pointers | 65.3% | 50.0% | 6m |
| 540 | Single Element in a Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 59.3% | 50.0% | 6m |
| 987 | Vertical Order Traversal of a Binary Tree | Hard | Trees | DFS / BFS | 53.8% | 50.0% | 6m |
| 485 | Max Consecutive Ones | Easy | Core DSA | Implementation / Reasoning | 65.2% | 50.0% | 6m |
| 219 | Contains Duplicate II | Easy | Arrays | Sorting / Prefix / Scan | 51.3% | 50.0% | 6m |
| 148 | Sort List | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 64.4% | 50.0% | 6m |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 50.0% | 6m |
| 98 | Validate Binary Search Tree | Medium | Strings; Trees; Binary Search | Hashing / Sliding Window; DFS / BFS; Binary Search | 35.8% | 50.0% | 6m |
| 643 | Maximum Average Subarray I | Easy | Arrays | Sorting / Prefix / Scan | 47.8% | 50.0% | 6m |
| 227 | Basic Calculator II | Medium | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 50.0% | 6m |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | Trees | DFS / BFS | 68.8% | 50.0% | 6m |
| 1148 | Article Views I | Easy | Core DSA | Implementation / Reasoning | 76.6% | 50.0% | 6m |
| 36 | Valid Sudoku | Medium | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 64.5% | 50.0% | 6m |
| 32 | Longest Valid Parentheses | Hard | Strings | Hashing / Sliding Window | 38.8% | 50.0% | 6m |
| 19 | Remove Nth Node From End of List | Medium | Trees; Linked List | DFS / BFS; Two Pointers | 51.6% | 50.0% | all |
| 24 | Swap Nodes in Pairs | Medium | Trees | DFS / BFS | 69.5% | 50.0% | all |
| 103 | Binary Tree Zigzag Level Order Traversal | Medium | Trees | DFS / BFS | 63.7% | 50.0% | all |
| 104 | Maximum Depth of Binary Tree | Easy | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 78.2% | 50.0% | all |
| 117 | Populating Next Right Pointers in Each Node II | Medium | Trees | DFS / BFS | 57.6% | 50.0% | all |
| 122 | Best Time to Buy and Sell Stock II | Medium | Core DSA | Implementation / Reasoning | 71.1% | 50.0% | all |
| 160 | Intersection of Two Linked Lists | Easy | Linked List | Two Pointers | 63.7% | 50.0% | all |
| 172 | Factorial Trailing Zeroes | Medium | Core DSA | Implementation / Reasoning | 46.7% | 50.0% | all |
| 179 | Largest Number | Medium | Core DSA | Implementation / Reasoning | 43.1% | 50.0% | all |
| 207 | Course Schedule | Medium | Graphs | BFS / DFS / Topological Sort | 51.4% | 50.0% | all |
| 229 | Majority Element II | Medium | Core DSA | Implementation / Reasoning | 56.2% | 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 |
| 274 | H-Index | Medium | Core DSA | Implementation / Reasoning | 41.4% | 50.0% | all |
| 297 | Serialize and Deserialize Binary Tree | Hard | Trees; Design | DFS / BFS; Data Structure Design | 60.8% | 50.0% | all |
| 328 | Odd Even Linked List | Medium | Linked List | Two Pointers | 62.5% | 50.0% | all |
| 386 | Lexicographical Numbers | Medium | Graphs | BFS / DFS / Topological Sort | 76.2% | 50.0% | all |
| 443 | String Compression | Medium | Strings | Hashing / Sliding Window | 60.0% | 50.0% | all |
| 901 | Online Stock Span | Medium | Core DSA | Implementation / Reasoning | 69.1% | 50.0% | all |
| 912 | Sort an Array | Medium | Arrays | Sorting / Prefix / Scan | 55.9% | 50.0% | all |
| 1482 | Minimum Number of Days to Make m Bouquets | Medium | Arrays | Sorting / Prefix / Scan | 56.6% | 50.0% | all |
| 1661 | Average Time of Process per Machine | Easy | Core DSA | Implementation / Reasoning | 66.8% | 50.0% | all |
| 1768 | Merge Strings Alternately | Easy | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 82.1% | 50.0% | all |
| 7 | Reverse Integer | Medium | Core DSA | Implementation / Reasoning | 31.9% | 37.5% | 3m |
| 8 | String to Integer (atoi) | Medium | Strings | Hashing / Sliding Window | 21.0% | 37.5% | 3m |
| 238 | Product of Array Except Self | Medium | Arrays | Sorting / Prefix / Scan | 68.9% | 37.5% | 3m |
| 66 | Plus One | Easy | Core DSA | Implementation / Reasoning | 50.0% | 37.5% | 3m |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 37.5% | 3m |
| 11 | Container With Most Water | Medium | Core DSA | Two Pointers | 60.0% | 37.5% | 3m |
| 704 | Binary Search | Easy | Binary Search | Binary Search | 60.9% | 37.5% | 3m |
| 67 | Add Binary | Easy | Core DSA | Implementation / Reasoning | 58.1% | 37.5% | 3m |
| 739 | Daily Temperatures | Medium | Stack / Queue | Monotonic Stack / Simulation | 68.7% | 37.5% | 3m |
| 74 | Search a 2D Matrix | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 53.9% | 37.5% | 3m |
| 61 | Rotate List | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 42.6% | 37.5% | 3m |
| 136 | Single Number | Easy | Core DSA | Implementation / Reasoning | 77.7% | 37.5% | 3m |
| 175 | Combine Two Tables | Easy | Core DSA | Implementation / Reasoning | 79.5% | 37.5% | 3m |
| 55 | Jump Game | Medium | Greedy | Greedy | 40.9% | 37.5% | 3m |
| 100 | Same Tree | Easy | Trees | DFS / BFS | 67.1% | 37.5% | 3m |
| 169 | Majority Element | Easy | Core DSA | Implementation / Reasoning | 66.3% | 37.5% | 3m |
| 611 | Valid Triangle Number | Medium | Strings | Hashing / Sliding Window | 56.9% | 37.5% | 3m |
| 547 | Number of Provinces | Medium | Core DSA | Implementation / Reasoning | 70.4% | 37.5% | 3m |
| 435 | Non-overlapping Intervals | Medium | Arrays; Greedy | Sorting / Prefix / Scan; Greedy | 57.1% | 37.5% | 3m |
| 1480 | Running Sum of 1d Array | Easy | Arrays | Sorting / Prefix / Scan | 86.9% | 37.5% | 3m |
| 142 | Linked List Cycle II | Medium | Linked List | Two Pointers | 57.9% | 37.5% | 3m |
| 3848 | Check Digitorial Permutation | Medium | Backtracking | Backtracking | 46.7% | 37.5% | 3m |
| 503 | Next Greater Element II | Medium | Stack / Queue | Monotonic Stack / Simulation | 68.4% | 37.5% | 3m |
| 525 | Contiguous Array | Medium | Arrays | Sorting / Prefix / Scan | 51.3% | 37.5% | 3m |
| 450 | Delete Node in a BST | Medium | Trees | DFS / BFS | 54.7% | 37.5% | 3m |
| 77 | Combinations | Medium | Backtracking | Backtracking | 74.6% | 37.5% | 3m |
| 326 | Power of Three | Easy | Core DSA | Implementation / Reasoning | 51.1% | 37.5% | 3m |
| 509 | Fibonacci Number | Easy | Core DSA | Implementation / Reasoning | 74.1% | 37.5% | 3m |
| 1727 | Largest Submatrix With Rearrangements | Medium | Arrays | Sorting / Prefix / Scan | 80.2% | 37.5% | 3m |
| 111 | Minimum Depth of Binary Tree | Easy | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 52.9% | 37.5% | 3m |
| 225 | Implement Stack using Queues | Easy | Stack / Queue | Monotonic Stack / Simulation | 69.9% | 37.5% | 3m |
| 6 | Zigzag Conversion | Medium | Core DSA | Implementation / Reasoning | 54.2% | 37.5% | 3m |
| 206 | Reverse Linked List | Easy | Linked List | Two Pointers | 80.6% | 37.5% | 3m |
| 153 | Find Minimum in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 54.7% | 37.5% | 3m |
| 977 | Squares of a Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 73.8% | 37.5% | 3m |
| 215 | Kth Largest Element in an Array | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 68.9% | 37.5% | 3m |
| 678 | Valid Parenthesis String | Medium | Strings | Hashing / Sliding Window | 40.1% | 37.5% | 3m |
| 210 | Course Schedule II | Medium | Graphs | BFS / DFS / Topological Sort | 55.5% | 37.5% | 3m |
| 59 | Spiral Matrix II | Medium | Arrays | Sorting / Prefix / Scan | 75.1% | 37.5% | 3m |
| 228 | Summary Ranges | Easy | Arrays | Sorting / Prefix / Scan | 54.2% | 37.5% | 3m |
| 368 | Largest Divisible Subset | Medium | Core DSA | Implementation / Reasoning | 49.6% | 37.5% | 3m |
| 584 | Find Customer Referee | Easy | Core DSA | Implementation / Reasoning | 72.9% | 37.5% | 3m |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 37.5% | 3m |
| 1848 | Minimum Distance to the Target Element | Easy | Arrays | Sorting / Prefix / Scan | 64.5% | 37.5% | 3m |
| 2035 | Partition Array Into Two Arrays to Minimize Sum Difference | Hard | Arrays; Dynamic Programming | Sorting / Prefix / Scan; State Transition | 23.4% | 37.5% | 3m |
| 438 | Find All Anagrams in a String | Medium | Strings | Hashing / Sliding Window | 53.8% | 37.5% | 3m |
| 332 | Reconstruct Itinerary | Hard | Core DSA | Implementation / Reasoning | 44.6% | 37.5% | 3m |
| 181 | Employees Earning More Than Their Managers | Easy | Core DSA | Implementation / Reasoning | 73.2% | 37.5% | 3m |
| 78 | Subsets | Medium | Backtracking | Backtracking | 82.3% | 37.5% | 3m |
| 176 | Second Highest Salary | Medium | Core DSA | Implementation / Reasoning | 47.0% | 37.5% | 3m |
| 1929 | Concatenation of Array | Easy | Arrays | Sorting / Prefix / Scan | 90.3% | 37.5% | 3m |
| 349 | Intersection of Two Arrays | Easy | Arrays | Sorting / Prefix / Scan | 77.8% | 37.5% | 3m |
| 150 | Evaluate Reverse Polish Notation | Medium | Core DSA | Implementation / Reasoning | 57.8% | 37.5% | 3m |
| 40 | Combination Sum II | Medium | Arrays; Backtracking | Sorting / Prefix / Scan; Backtracking | 59.5% | 37.5% | 3m |
| 1321 | Restaurant Growth | Medium | Core DSA | Implementation / Reasoning | 58.8% | 37.5% | 3m |
| 135 | Candy | Hard | Core DSA | Implementation / Reasoning | 48.5% | 37.5% | 3m |
| 209 | Minimum Size Subarray Sum | Medium | Arrays | Sorting / Prefix / Scan | 51.7% | 37.5% | 3m |
| 412 | Fizz Buzz | Easy | Core DSA | Implementation / Reasoning | 75.5% | 37.5% | 3m |
| 34 | Find First and Last Position of Element in Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 48.9% | 37.5% | 3m |
| 1722 | Minimize Hamming Distance After Swap Operations | Medium | Core DSA | Implementation / Reasoning | 69.7% | 37.5% | 3m |
| 28 | Find the Index of the First Occurrence in a String | Easy | Strings | Hashing / Sliding Window | 46.7% | 37.5% | 3m |
| 1235 | Maximum Profit in Job Scheduling | Hard | Arrays | Sorting / Prefix / Scan | 54.7% | 37.5% | 3m |
| 268 | Missing Number | Easy | Arrays | Sorting / Prefix / Scan | 72.0% | 37.5% | 3m |
| 197 | Rising Temperature | Easy | Core DSA | Implementation / Reasoning | 51.3% | 37.5% | 3m |
| 162 | Find Peak Element | Medium | Binary Search | Binary Search | 47.0% | 37.5% | 3m |
| 595 | Big Countries | Easy | Trees | DFS / BFS | 68.5% | 37.5% | 3m |
| 224 | Basic Calculator | Hard | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 37.5% | 3m |
| 37 | Sudoku Solver | Hard | Backtracking | Backtracking | 65.5% | 37.5% | 3m |
| 941 | Valid Mountain Array | Easy | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 35.3% | 37.5% | 3m |
| 2657 | Find the Prefix Common Array of Two Arrays | Medium | Arrays | Sorting / Prefix / Scan | 88.3% | 37.5% | 3m |
| 1757 | Recyclable and Low Fat Products | Easy | Arrays | Sorting / Prefix / Scan | 88.6% | 37.5% | 3m |
| 300 | Longest Increasing Subsequence | Medium | Dynamic Programming | State Transition | 59.4% | 37.5% | 3m |