323 curated coding interview questions directly asked in Oracle technical rounds, sorted by frequency with recency and difficulty diagnostics.
Showing top 200 of 323 questions. View all 323 in the interactive tracker.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 100.0% | 3m |
| 129 | Sum Root to Leaf Numbers | Medium | Arrays | Sorting / Prefix / Scan | 70.0% | 87.5% | 3m |
| 498 | Diagonal Traverse | Medium | Core DSA | Implementation / Reasoning | 67.2% | 87.5% | 3m |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 87.5% | 3m |
| 199 | Binary Tree Right Side View | Medium | Trees | DFS / BFS | 70.2% | 87.5% | 3m |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 75.0% | 6m |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 75.0% | 6m |
| 460 | LFU Cache | Hard | Design | Data Structure Design | 49.2% | 75.0% | 6m |
| 735 | Asteroid Collision | Medium | Core DSA | Implementation / Reasoning | 47.9% | 75.0% | 6m |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 75.0% | all |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 75.0% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 62.5% | 6m |
| 23 | Merge k Sorted Lists | Hard | Arrays; Linked List; Heap | Sorting / Prefix / Scan; Two Pointers; Priority Queue | 59.6% | 62.5% | 6m |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 62.5% | 6m |
| 253 | Meeting Rooms II | Medium | Greedy | Greedy | 52.7% | 62.5% | 6m |
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 62.5% | 6m |
| 11 | Container With Most Water | Medium | Core DSA | Two Pointers | 60.0% | 62.5% | 6m |
| 875 | Koko Eating Bananas | Medium | Binary Search | Binary Search | 50.0% | 62.5% | 6m |
| 127 | Word Ladder | Hard | Strings | Hashing / Sliding Window | 45.6% | 62.5% | 6m |
| 543 | Diameter of Binary Tree | Easy | Trees | DFS / BFS | 65.5% | 62.5% | 6m |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 62.5% | 6m |
| 102 | Binary Tree Level Order Traversal | Medium | Trees | DFS / BFS | 72.7% | 62.5% | 6m |
| 155 | Min Stack | Medium | Stack / Queue | Monotonic Stack / Simulation | 58.2% | 62.5% | 6m |
| 845 | Longest Mountain in Array | Medium | Arrays | Sorting / Prefix / Scan | 42.1% | 62.5% | 6m |
| 34 | Find First and Last Position of Element in Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 48.9% | 62.5% | 6m |
| 695 | Max Area of Island | Medium | Graphs | BFS / DFS / Topological Sort | 74.0% | 62.5% | 6m |
| 1169 | Invalid Transactions | Medium | Strings | Hashing / Sliding Window | 32.3% | 62.5% | 6m |
| 366 | Find Leaves of Binary Tree | Medium | Trees | DFS / BFS | 81.3% | 62.5% | 6m |
| 981 | Time Based Key-Value Store | Medium | Core DSA | Implementation / Reasoning | 49.9% | 62.5% | 6m |
| 1669 | Merge In Between Linked Lists | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 83.0% | 62.5% | 6m |
| 76 | Minimum Window Substring | Hard | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS; Sliding Window | 47.5% | 62.5% | 6m |
| 322 | Coin Change | Medium | Dynamic Programming | State Transition | 48.4% | 62.5% | 6m |
| 752 | Open the Lock | Medium | Core DSA | Implementation / Reasoning | 61.3% | 62.5% | 6m |
| 13 | Roman to Integer | Easy | Strings | Hashing / Sliding Window | 66.6% | 62.5% | all |
| 15 | 3Sum | Medium | Arrays | Sorting / Prefix / Scan | 39.1% | 62.5% | all |
| 22 | Generate Parentheses | Medium | Strings | Hashing / Sliding Window | 78.7% | 62.5% | all |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 62.5% | all |
| 128 | Longest Consecutive Sequence | Medium | Core DSA | Implementation / Reasoning | 47.1% | 62.5% | all |
| 206 | Reverse Linked List | Easy | Linked List | Two Pointers | 80.6% | 62.5% | all |
| 236 | Lowest Common Ancestor of a Binary Tree | Medium | Trees | DFS / BFS | 69.3% | 62.5% | all |
| 242 | Valid Anagram | Easy | Strings | Hashing / Sliding Window | 68.1% | 62.5% | all |
| 295 | Find Median from Data Stream | Hard | Heap | Priority Queue | 54.5% | 62.5% | all |
| 394 | Decode String | Medium | Strings; Dynamic Programming; Stack / Queue | Hashing / Sliding Window; State Transition; Monotonic Stack / Simulation | 62.6% | 62.5% | all |
| 450 | Delete Node in a BST | Medium | Trees | DFS / BFS | 54.7% | 62.5% | all |
| 2466 | Count Ways To Build Good Strings | Medium | Strings | Hashing / Sliding Window | 58.9% | 62.5% | all |
| 2506 | Count Pairs Of Similar Strings | Easy | Strings | Hashing / Sliding Window | 73.7% | 62.5% | all |
| 2580 | Count Ways to Group Overlapping Ranges | Medium | Core DSA | Implementation / Reasoning | 39.1% | 62.5% | all |
| 2549 | Count Distinct Numbers on Board | Easy | Core DSA | Implementation / Reasoning | 61.8% | 62.5% | all |
| 2836 | Maximize Value of Function in a Ball Passing Game | Hard | Core DSA | Implementation / Reasoning | 31.0% | 62.5% | all |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 62.5% | all |
| 3012 | Minimize Length of Array Using Operations | Medium | Arrays | Sorting / Prefix / Scan | 35.8% | 62.5% | all |
| 3015 | Count the Number of Houses at a Certain Distance I | Medium | Core DSA | Implementation / Reasoning | 57.7% | 62.5% | all |
| 3017 | Count the Number of Houses at a Certain Distance II | Hard | Core DSA | Implementation / Reasoning | 23.7% | 62.5% | all |
| 2192 | All Ancestors of a Node in a Directed Acyclic Graph | Medium | Trees; Graphs | DFS / BFS; BFS / DFS / Topological Sort | 62.2% | 62.5% | all |
| 1380 | Lucky Numbers in a Matrix | Easy | Arrays | Sorting / Prefix / Scan | 80.0% | 62.5% | all |
| 1410 | HTML Entity Parser | Medium | Core DSA | Implementation / Reasoning | 50.1% | 62.5% | all |
| 1611 | Minimum One Bit Operations to Make Integers Zero | Hard | Arrays | Sorting / Prefix / Scan | 78.4% | 62.5% | all |
| 1797 | Design Authentication Manager | Medium | Design | Data Structure Design | 58.6% | 62.5% | all |
| 1200 | Minimum Absolute Difference | Easy | Arrays | Sorting / Prefix / Scan | 75.1% | 62.5% | all |
| 3438 | Find Valid Pair of Adjacent Digits in String | Easy | Strings | Hashing / Sliding Window | 60.9% | 62.5% | all |
| 1209 | Remove All Adjacent Duplicates in String II | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 61.3% | 50.0% | 6m |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 50.0% | 6m |
| 1235 | Maximum Profit in Job Scheduling | Hard | Arrays | Sorting / Prefix / Scan | 54.7% | 50.0% | 6m |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 50.0% | 6m |
| 207 | Course Schedule | Medium | Graphs | BFS / DFS / Topological Sort | 51.4% | 50.0% | 6m |
| 1539 | Kth Missing Positive Number | Easy | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 63.5% | 50.0% | 6m |
| 767 | Reorganize String | Medium | Strings | Hashing / Sliding Window | 57.1% | 50.0% | 6m |
| 1944 | Number of Visible People in a Queue | Hard | Stack / Queue | Monotonic Stack / Simulation | 73.1% | 50.0% | 6m |
| 4 | Median of Two Sorted Arrays | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 46.6% | 50.0% | 6m |
| 445 | Add Two Numbers II | Medium | Core DSA | Implementation / Reasoning | 62.6% | 50.0% | 6m |
| 378 | Kth Smallest Element in a Sorted Matrix | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 64.6% | 50.0% | 6m |
| 107 | Binary Tree Level Order Traversal II | Medium | Trees | DFS / BFS | 68.2% | 50.0% | 6m |
| 987 | Vertical Order Traversal of a Binary Tree | Hard | Trees | DFS / BFS | 53.8% | 50.0% | 6m |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 50.0% | 6m |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 50.0% | 6m |
| 2204 | Distance to a Cycle in Undirected Graph | Hard | Graphs; Linked List | BFS / DFS / Topological Sort; Two Pointers | 73.6% | 50.0% | 6m |
| 1290 | Convert Binary Number in a Linked List to Integer | Easy | Linked List | Two Pointers | 82.4% | 50.0% | 6m |
| 3650 | Minimum Cost Path with Edge Reversals | Medium | Arrays | Sorting / Prefix / Scan | 61.8% | 50.0% | 6m |
| 1488 | Avoid Flood in The City | Medium | Core DSA | Implementation / Reasoning | 39.0% | 50.0% | 6m |
| 359 | Logger Rate Limiter | Easy | Design | Data Structure Design | 76.8% | 50.0% | 6m |
| 6 | Zigzag Conversion | Medium | Core DSA | Implementation / Reasoning | 54.2% | 50.0% | 6m |
| 12 | Integer to Roman | Medium | Strings | Hashing / Sliding Window | 71.0% | 50.0% | all |
| 14 | Longest Common Prefix | Easy | Core DSA | Implementation / Reasoning | 47.6% | 50.0% | all |
| 17 | Letter Combinations of a Phone Number | Medium | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 66.1% | 50.0% | all |
| 41 | First Missing Positive | Hard | Arrays | Sorting / Prefix / Scan | 42.9% | 50.0% | all |
| 75 | Sort Colors | Medium | Arrays | Sorting / Prefix / Scan | 69.6% | 50.0% | all |
| 93 | Restore IP Addresses | Medium | Core DSA | Implementation / Reasoning | 56.0% | 50.0% | all |
| 98 | Validate Binary Search Tree | Medium | Strings; Trees; Binary Search | Hashing / Sliding Window; DFS / BFS; Binary Search | 35.8% | 50.0% | all |
| 103 | Binary Tree Zigzag Level Order Traversal | Medium | Trees | DFS / BFS | 63.7% | 50.0% | all |
| 124 | Binary Tree Maximum Path Sum | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 42.3% | 50.0% | all |
| 134 | Gas Station | Medium | Greedy | Greedy | 48.0% | 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 |
| 169 | Majority Element | Easy | Core DSA | Implementation / Reasoning | 66.3% | 50.0% | all |
| 179 | Largest Number | Medium | Core DSA | Implementation / Reasoning | 43.1% | 50.0% | all |
| 210 | Course Schedule II | Medium | Graphs | BFS / DFS / Topological Sort | 55.5% | 50.0% | all |
| 215 | Kth Largest Element in an Array | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 68.9% | 50.0% | all |
| 221 | Maximal Square | Medium | Core DSA | Implementation / Reasoning | 50.3% | 50.0% | all |
| 230 | Kth Smallest Element in a BST | Medium | Trees; Heap | DFS / BFS; Priority Queue | 76.8% | 50.0% | all |
| 240 | Search a 2D Matrix II | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 57.3% | 50.0% | all |
| 238 | Product of Array Except Self | Medium | Arrays | Sorting / Prefix / Scan | 68.9% | 50.0% | all |
| 252 | Meeting Rooms | Easy | Greedy | Greedy | 59.4% | 50.0% | all |
| 283 | Move Zeroes | Easy | Core DSA | Two Pointers | 63.8% | 50.0% | all |
| 300 | Longest Increasing Subsequence | Medium | Dynamic Programming | State Transition | 59.4% | 50.0% | all |
| 345 | Reverse Vowels of a String | Easy | Strings | Hashing / Sliding Window | 61.3% | 50.0% | all |
| 74 | Search a 2D Matrix | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 53.9% | 50.0% | all |
| 380 | Insert Delete GetRandom O(1) | Medium | Core DSA | Implementation / Reasoning | 55.4% | 50.0% | all |
| 443 | String Compression | Medium | Strings | Hashing / Sliding Window | 60.0% | 50.0% | all |
| 525 | Contiguous Array | Medium | Arrays | Sorting / Prefix / Scan | 51.3% | 50.0% | all |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 50.0% | all |
| 588 | Design In-Memory File System | Hard | Design | Data Structure Design | 48.4% | 50.0% | all |
| 621 | Task Scheduler | Medium | Greedy | Greedy | 63.1% | 50.0% | all |
| 697 | Degree of an Array | Easy | Arrays | Sorting / Prefix / Scan | 58.4% | 50.0% | all |
| 1353 | Maximum Number of Events That Can Be Attended | Medium | Arrays | Sorting / Prefix / Scan | 39.0% | 50.0% | all |
| 96 | Unique Binary Search Trees | Medium | Trees; Binary Search | DFS / BFS; Binary Search | 63.7% | 50.0% | all |
| 2291 | Maximum Profit From Trading Stocks | Medium | Arrays | Sorting / Prefix / Scan | 48.2% | 50.0% | all |
| 125 | Valid Palindrome | Easy | Strings | Hashing / Sliding Window | 53.3% | 50.0% | all |
| 71 | Simplify Path | Medium | Core DSA | Implementation / Reasoning | 50.6% | 50.0% | all |
| 647 | Palindromic Substrings | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 72.8% | 50.0% | all |
| 51 | N-Queens | Hard | Backtracking | Backtracking | 75.5% | 50.0% | all |
| 208 | Implement Trie (Prefix Tree) | Medium | Trees | DFS / BFS | 69.5% | 50.0% | all |
| 755 | Pour Water | Medium | Core DSA | Implementation / Reasoning | 49.1% | 50.0% | all |
| 2954 | Count the Number of Infection Sequences | Hard | Core DSA | Implementation / Reasoning | 37.8% | 50.0% | all |
| 3799 | Word Squares II | Medium | Strings | Hashing / Sliding Window | 55.1% | 50.0% | all |
| 2 | Add Two Numbers | Medium | Core DSA | Implementation / Reasoning | 48.5% | 37.5% | all |
| 10 | Regular Expression Matching | Hard | Core DSA | Implementation / Reasoning | 31.0% | 37.5% | all |
| 21 | Merge Two Sorted Lists | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 68.3% | 37.5% | all |
| 26 | Remove Duplicates from Sorted Array | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 62.8% | 37.5% | all |
| 40 | Combination Sum II | Medium | Arrays; Backtracking | Sorting / Prefix / Scan; Backtracking | 59.5% | 37.5% | all |
| 45 | Jump Game II | Medium | Greedy | Greedy | 42.9% | 37.5% | all |
| 46 | Permutations | Medium | Backtracking | Backtracking | 81.9% | 37.5% | all |
| 50 | Pow(x, n) | Medium | Core DSA | Implementation / Reasoning | 38.7% | 37.5% | all |
| 48 | Rotate Image | Medium | Arrays | Sorting / Prefix / Scan | 80.1% | 37.5% | all |
| 55 | Jump Game | Medium | Greedy | Greedy | 40.9% | 37.5% | all |
| 61 | Rotate List | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 42.6% | 37.5% | all |
| 73 | Set Matrix Zeroes | Medium | Arrays | Sorting / Prefix / Scan | 62.9% | 37.5% | all |
| 79 | Word Search | Medium | Strings; Binary Search | Hashing / Sliding Window; Binary Search | 47.4% | 37.5% | all |
| 83 | Remove Duplicates from Sorted List | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 56.7% | 37.5% | all |
| 88 | Merge Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 54.9% | 37.5% | all |
| 113 | Path Sum II | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 62.2% | 37.5% | all |
| 116 | Populating Next Right Pointers in Each Node | Medium | Trees | DFS / BFS | 67.2% | 37.5% | all |
| 141 | Linked List Cycle | Easy | Linked List | Two Pointers | 54.3% | 37.5% | all |
| 148 | Sort List | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 64.4% | 37.5% | all |
| 162 | Find Peak Element | Medium | Binary Search | Binary Search | 47.0% | 37.5% | all |
| 205 | Isomorphic Strings | Easy | Strings | Hashing / Sliding Window | 48.4% | 37.5% | all |
| 209 | Minimum Size Subarray Sum | Medium | Arrays | Sorting / Prefix / Scan | 51.7% | 37.5% | all |
| 224 | Basic Calculator | Hard | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 37.5% | all |
| 9 | Palindrome Number | Easy | Strings | Hashing / Sliding Window | 60.6% | 37.5% | all |
| 237 | Delete Node in a Linked List | Medium | Trees; Linked List | DFS / BFS; Two Pointers | 83.9% | 37.5% | all |
| 273 | Integer to English Words | Hard | Strings | Hashing / Sliding Window | 35.0% | 37.5% | all |
| 69 | Sqrt(x) | Easy | Binary Search | Binary Search | 41.8% | 37.5% | all |
| 387 | First Unique Character in a String | Easy | Strings | Hashing / Sliding Window | 65.5% | 37.5% | all |
| 415 | Add Strings | Easy | Strings | Hashing / Sliding Window | 52.2% | 37.5% | all |
| 463 | Island Perimeter | Easy | Graphs | BFS / DFS / Topological Sort | 74.4% | 37.5% | all |
| 468 | Validate IP Address | Medium | Strings | Hashing / Sliding Window | 28.3% | 37.5% | all |
| 2472 | Maximum Number of Non-overlapping Palindrome Substrings | Hard | Arrays; Strings; Trees; Greedy | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS; Greedy | 44.7% | 37.5% | all |
| 540 | Single Element in a Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 59.3% | 37.5% | all |
| 2561 | Rearranging Fruits | Hard | Core DSA | Implementation / Reasoning | 57.3% | 37.5% | all |
| 692 | Top K Frequent Words | Medium | Strings; Heap | Hashing / Sliding Window; Priority Queue | 60.2% | 37.5% | all |
| 694 | Number of Distinct Islands | Medium | Graphs | BFS / DFS / Topological Sort | 62.8% | 37.5% | all |
| 696 | Count Binary Substrings | Easy | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 70.4% | 37.5% | all |
| 139 | Word Break | Medium | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 49.5% | 37.5% | all |
| 739 | Daily Temperatures | Medium | Stack / Queue | Monotonic Stack / Simulation | 68.7% | 37.5% | all |
| 706 | Design HashMap | Easy | Design | Data Structure Design | 66.6% | 37.5% | all |
| 1010 | Pairs of Songs With Total Durations Divisible by 60 | Medium | Core DSA | Implementation / Reasoning | 53.5% | 37.5% | all |
| 1011 | Capacity To Ship Packages Within D Days | Medium | Binary Search | Binary Search | 73.9% | 37.5% | all |
| 1047 | Remove All Adjacent Duplicates In String | Easy | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 73.2% | 37.5% | all |
| 1268 | Search Suggestions System | Medium | Binary Search | Binary Search | 65.2% | 37.5% | all |
| 1636 | Sort Array by Increasing Frequency | Easy | Arrays | Sorting / Prefix / Scan | 80.8% | 37.5% | all |
| 115 | Distinct Subsequences | Hard | Core DSA | Implementation / Reasoning | 51.9% | 37.5% | all |
| 435 | Non-overlapping Intervals | Medium | Arrays; Greedy | Sorting / Prefix / Scan; Greedy | 57.1% | 37.5% | all |
| 2151 | Maximum Good People Based on Statements | Hard | Arrays | Sorting / Prefix / Scan | 52.4% | 37.5% | all |
| 912 | Sort an Array | Medium | Arrays | Sorting / Prefix / Scan | 55.9% | 37.5% | all |
| 114 | Flatten Binary Tree to Linked List | Medium | Trees; Linked List | DFS / BFS; Two Pointers | 70.7% | 37.5% | all |
| 217 | Contains Duplicate | Easy | Arrays | Sorting / Prefix / Scan | 64.4% | 37.5% | all |
| 582 | Kill Process | Medium | Core DSA | Implementation / Reasoning | 70.7% | 37.5% | all |
| 151 | Reverse Words in a String | Medium | Strings | Hashing / Sliding Window | 56.4% | 37.5% | all |
| 1823 | Find the Winner of the Circular Game | Medium | Core DSA | Implementation / Reasoning | 82.2% | 37.5% | all |
| 1507 | Reformat Date | Easy | Core DSA | Implementation / Reasoning | 68.5% | 37.5% | all |
| 496 | Next Greater Element I | Easy | Stack / Queue | Monotonic Stack / Simulation | 76.1% | 37.5% | all |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 37.5% | all |
| 567 | Permutation in String | Medium | Strings; Backtracking | Hashing / Sliding Window; Sliding Window; Backtracking | 48.9% | 37.5% | all |
| 2062 | Count Vowel Substrings of a String | Easy | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 73.2% | 37.5% | all |
| 153 | Find Minimum in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 54.7% | 37.5% | all |
| 227 | Basic Calculator II | Medium | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 37.5% | all |
| 31 | Next Permutation | Medium | Backtracking | Backtracking | 45.3% | 37.5% | all |
| 1283 | Find the Smallest Divisor Given a Threshold | Medium | Core DSA | Implementation / Reasoning | 65.9% | 37.5% | all |
| 340 | Longest Substring with At Most K Distinct Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 50.0% | 37.5% | all |
| 2303 | Calculate Amount Paid in Taxes | Easy | Core DSA | Implementation / Reasoning | 69.3% | 37.5% | all |
| 863 | All Nodes Distance K in Binary Tree | Medium | Trees | DFS / BFS | 67.7% | 37.5% | all |
| 120 | Triangle | Medium | Core DSA | Implementation / Reasoning | 59.9% | 37.5% | all |
| 1249 | Minimum Remove to Make Valid Parentheses | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 71.5% | 37.5% | all |
| 713 | Subarray Product Less Than K | Medium | Arrays | Sorting / Prefix / Scan | 54.3% | 37.5% | all |
| 2448 | Minimum Cost to Make Array Equal | Hard | Arrays | Sorting / Prefix / Scan | 46.8% | 37.5% | all |
| 133 | Clone Graph | Medium | Graphs | BFS / DFS / Topological Sort | 65.3% | 37.5% | all |
| 7 | Reverse Integer | Medium | Core DSA | Implementation / Reasoning | 31.9% | 37.5% | all |
| 2008 | Maximum Earnings From Taxi | Medium | Arrays | Sorting / Prefix / Scan | 46.5% | 37.5% | all |
| 841 | Keys and Rooms | Medium | Core DSA | Implementation / Reasoning | 75.8% | 37.5% | all |
| 29 | Divide Two Integers | Medium | Core DSA | Implementation / Reasoning | 19.8% | 37.5% | all |
| 176 | Second Highest Salary | Medium | Core DSA | Implementation / Reasoning | 47.0% | 37.5% | all |