DSA Doctor
Verified Company Vault
30d Active
Salesforce DSA Interview Questions
187 curated coding interview questions directly asked in Salesforce technical rounds, sorted by frequency with recency and difficulty diagnostics.
187
Total Questions
27 (14%)
Easy Problems
111 (59%)
Medium Problems
49 (26%)
Hard Problems
🔥 Most Tested Topics:
Arrays (66)Core DSA (47)Strings (39)Trees (29)Dynamic Programming (13)
📂 Sourced Datasets:
Last 30 daysLast 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 2380 | Time Needed to Rearrange a Binary String | Medium | Strings | Hashing / Sliding Window | 53.0% | 100.0% | 30d |
| 2571 | Minimum Operations to Reduce an Integer to 0 | Medium | Arrays | Sorting / Prefix / Scan | 62.4% | 100.0% | 30d |
| 3035 | Maximum Palindromes After Operations | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 46.5% | 100.0% | 3m |
| 3634 | Minimum Removals to Balance Array | Medium | Arrays | Sorting / Prefix / Scan | 47.9% | 75.0% | 3m |
| 460 | LFU Cache | Hard | Design | Data Structure Design | 49.2% | 75.0% | 3m |
| 713 | Subarray Product Less Than K | Medium | Arrays | Sorting / Prefix / Scan | 54.3% | 75.0% | all |
| 2957 | Remove Adjacent Almost-Equal Characters | Medium | Strings | Hashing / Sliding Window | 53.7% | 75.0% | all |
| 3398 | Smallest Substring With Identical Characters I | Hard | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 20.6% | 75.0% | all |
| 3399 | Smallest Substring With Identical Characters II | Hard | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 40.3% | 75.0% | all |
| 3488 | Closest Equal Element Queries | Medium | Core DSA | Implementation / Reasoning | 51.4% | 75.0% | all |
| 443 | String Compression | Medium | Strings | Hashing / Sliding Window | 60.0% | 62.5% | 3m |
| 664 | Strange Printer | Hard | Core DSA | Implementation / Reasoning | 60.9% | 62.5% | 3m |
| 628 | Maximum Product of Three Numbers | Easy | Arrays | Sorting / Prefix / Scan | 45.9% | 62.5% | 3m |
| 210 | Course Schedule II | Medium | Graphs | BFS / DFS / Topological Sort | 55.5% | 62.5% | 3m |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 62.5% | 6m |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 62.5% | 6m |
| 1219 | Path with Maximum Gold | Medium | Arrays | Sorting / Prefix / Scan | 68.4% | 62.5% | 6m |
| 2603 | Collect Coins in a Tree | Hard | Trees; Dynamic Programming | DFS / BFS; State Transition | 40.1% | 62.5% | 6m |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 62.5% | all |
| 115 | Distinct Subsequences | Hard | Core DSA | Implementation / Reasoning | 51.9% | 62.5% | all |
| 124 | Binary Tree Maximum Path Sum | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 42.3% | 62.5% | all |
| 2068 | Check Whether Two Strings are Almost Equivalent | Easy | Strings | Hashing / Sliding Window | 64.3% | 62.5% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 62.5% | all |
| 647 | Palindromic Substrings | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 72.8% | 62.5% | all |
| 2563 | Count the Number of Fair Pairs | Medium | Core DSA | Implementation / Reasoning | 52.7% | 62.5% | all |
| 895 | Maximum Frequency Stack | Hard | Arrays; Stack / Queue | Sorting / Prefix / Scan; Monotonic Stack / Simulation | 66.8% | 62.5% | all |
| 2866 | Beautiful Towers II | Medium | Core DSA | Implementation / Reasoning | 36.5% | 62.5% | all |
| 2865 | Beautiful Towers I | Medium | Core DSA | Implementation / Reasoning | 44.5% | 62.5% | all |
| 1150 | Check If a Number Is Majority Element in a Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 59.9% | 62.5% | all |
| 1051 | Height Checker | Easy | Core DSA | Implementation / Reasoning | 81.7% | 62.5% | all |
| 2946 | Matrix Similarity After Cyclic Shifts | Easy | Arrays | Sorting / Prefix / Scan | 74.3% | 62.5% | all |
| 2992 | Number of Self-Divisible Permutations | Medium | Backtracking | Backtracking | 71.9% | 62.5% | all |
| 3125 | Maximum Number That Makes Result of Bitwise AND Zero | Medium | Arrays | Sorting / Prefix / Scan | 69.9% | 62.5% | all |
| 3171 | Find Subarray With Bitwise OR Closest to K | Hard | Arrays | Sorting / Prefix / Scan | 31.1% | 62.5% | all |
| 3135 | Equalize Strings by Adding or Removing Characters at Ends | Medium | Strings | Hashing / Sliding Window | 56.4% | 62.5% | all |
| 1268 | Search Suggestions System | Medium | Binary Search | Binary Search | 65.2% | 62.5% | all |
| 3193 | Count the Number of Inversions | Hard | Core DSA | Implementation / Reasoning | 30.5% | 62.5% | all |
| 3197 | Find the Minimum Area to Cover All Ones II | Hard | Arrays | Sorting / Prefix / Scan | 63.5% | 62.5% | all |
| 3195 | Find the Minimum Area to Cover All Ones I | Medium | Arrays | Sorting / Prefix / Scan | 78.2% | 62.5% | all |
| 3200 | Maximum Height of a Triangle | Easy | Arrays | Sorting / Prefix / Scan | 44.4% | 62.5% | all |
| 1326 | Minimum Number of Taps to Open to Water a Garden | Hard | Arrays | Sorting / Prefix / Scan | 51.0% | 62.5% | all |
| 1659 | Maximize Grid Happiness | Hard | Core DSA | Implementation / Reasoning | 41.0% | 62.5% | all |
| 1701 | Average Waiting Time | Medium | Core DSA | Implementation / Reasoning | 73.1% | 62.5% | all |
| 924 | Minimize Malware Spread | Hard | Core DSA | Implementation / Reasoning | 43.2% | 62.5% | all |
| 3313 | Find the Last Marked Nodes in Tree | Hard | Trees | DFS / BFS | 56.5% | 62.5% | all |
| 1297 | Maximum Number of Occurrences of a Substring | Medium | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS | 54.5% | 62.5% | all |
| 1221 | Split a String in Balanced Strings | Easy | Strings | Hashing / Sliding Window | 87.4% | 62.5% | all |
| 1143 | Longest Common Subsequence | Medium | Core DSA | Implementation / Reasoning | 59.2% | 62.5% | all |
| 3540 | Minimum Time to Visit All Houses | Medium | Arrays | Sorting / Prefix / Scan | 69.2% | 62.5% | all |
| 3607 | Power Grid Maintenance | Medium | Core DSA | Implementation / Reasoning | 56.2% | 62.5% | all |
| 3613 | Minimize Maximum Component Cost | Medium | Arrays; Graphs | Sorting / Prefix / Scan; BFS / DFS / Topological Sort | 43.5% | 62.5% | all |
| 740 | Delete and Earn | Medium | Core DSA | Implementation / Reasoning | 57.2% | 62.5% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 50.0% | 6m |
| 213 | House Robber II | Medium | Dynamic Programming | State Transition | 44.9% | 50.0% | 6m |
| 1522 | Diameter of N-Ary Tree | Medium | Trees | DFS / BFS | 75.5% | 50.0% | 6m |
| 934 | Shortest Bridge | Medium | Core DSA | Implementation / Reasoning | 59.5% | 50.0% | 6m |
| 6 | Zigzag Conversion | Medium | Core DSA | Implementation / Reasoning | 54.2% | 50.0% | 6m |
| 1839 | Longest Substring Of All Vowels in Order | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 51.8% | 50.0% | 6m |
| 207 | Course Schedule | Medium | Graphs | BFS / DFS / Topological Sort | 51.4% | 50.0% | 6m |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | Trees | DFS / BFS | 68.8% | 50.0% | 6m |
| 355 | Design Twitter | Medium | Design | Data Structure Design | 44.7% | 50.0% | 6m |
| 2534 | Time Taken to Cross the Door | Hard | Core DSA | Implementation / Reasoning | 50.3% | 50.0% | 6m |
| 25 | Reverse Nodes in k-Group | Hard | Trees; Linked List | DFS / BFS; Two Pointers | 66.1% | 50.0% | 6m |
| 992 | Subarrays with K Different Integers | Hard | Arrays | Sorting / Prefix / Scan | 68.1% | 50.0% | 6m |
| 22 | Generate Parentheses | Medium | Strings | Hashing / Sliding Window | 78.7% | 50.0% | 6m |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 50.0% | 6m |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 50.0% | all |
| 11 | Container With Most Water | Medium | Core DSA | Two Pointers | 60.0% | 50.0% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 50.0% | all |
| 76 | Minimum Window Substring | Hard | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS; Sliding Window | 47.5% | 50.0% | all |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 50.0% | all |
| 155 | Min Stack | Medium | Stack / Queue | Monotonic Stack / Simulation | 58.2% | 50.0% | all |
| 215 | Kth Largest Element in an Array | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 68.9% | 50.0% | all |
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 50.0% | all |
| 2484 | Count Palindromic Subsequences | Hard | Core DSA | Implementation / Reasoning | 41.2% | 50.0% | all |
| 735 | Asteroid Collision | Medium | Core DSA | Implementation / Reasoning | 47.9% | 50.0% | all |
| 1315 | Sum of Nodes with Even-Valued Grandparent | Medium | Arrays; Trees; Dynamic Programming | Sorting / Prefix / Scan; DFS / BFS; State Transition | 85.9% | 50.0% | all |
| 2966 | Divide Array Into Arrays With Max Difference | Medium | Arrays | Sorting / Prefix / Scan | 79.0% | 50.0% | all |
| 233 | Number of Digit One | Hard | Core DSA | Implementation / Reasoning | 38.7% | 50.0% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 50.0% | all |
| 1710 | Maximum Units on a Truck | Easy | Arrays | Sorting / Prefix / Scan | 74.9% | 50.0% | all |
| 2964 | Number of Divisible Triplet Sums | Medium | Arrays | Sorting / Prefix / Scan | 67.6% | 50.0% | all |
| 79 | Word Search | Medium | Strings; Binary Search | Hashing / Sliding Window; Binary Search | 47.4% | 50.0% | all |
| 532 | K-diff Pairs in an Array | Medium | Arrays | Sorting / Prefix / Scan | 45.9% | 50.0% | all |
| 863 | All Nodes Distance K in Binary Tree | Medium | Trees | DFS / BFS | 67.7% | 50.0% | all |
| 875 | Koko Eating Bananas | Medium | Binary Search | Binary Search | 50.0% | 50.0% | all |
| 2488 | Count Subarrays With Median K | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 48.8% | 50.0% | all |
| 3295 | Report Spam Message | Medium | Core DSA | Implementation / Reasoning | 48.7% | 50.0% | all |
| 15 | 3Sum | Medium | Arrays | Sorting / Prefix / Scan | 39.1% | 37.5% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 37.5% | all |
| 23 | Merge k Sorted Lists | Hard | Arrays; Linked List; Heap | Sorting / Prefix / Scan; Two Pointers; Priority Queue | 59.6% | 37.5% | all |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 37.5% | all |
| 41 | First Missing Positive | Hard | Arrays | Sorting / Prefix / Scan | 42.9% | 37.5% | all |
| 75 | Sort Colors | Medium | Arrays | Sorting / Prefix / Scan | 69.6% | 37.5% | all |
| 98 | Validate Binary Search Tree | Medium | Strings; Trees; Binary Search | Hashing / Sliding Window; DFS / BFS; Binary Search | 35.8% | 37.5% | all |
| 139 | Word Break | Medium | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 49.5% | 37.5% | all |
| 253 | Meeting Rooms II | Medium | Greedy | Greedy | 52.7% | 37.5% | all |
| 295 | Find Median from Data Stream | Hard | Heap | Priority Queue | 54.5% | 37.5% | all |
| 322 | Coin Change | Medium | Dynamic Programming | State Transition | 48.4% | 37.5% | all |
| 394 | Decode String | Medium | Strings; Dynamic Programming; Stack / Queue | Hashing / Sliding Window; State Transition; Monotonic Stack / Simulation | 62.6% | 37.5% | all |
| 696 | Count Binary Substrings | Easy | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 70.4% | 37.5% | all |
| 127 | Word Ladder | Hard | Strings | Hashing / Sliding Window | 45.6% | 37.5% | all |
| 1552 | Magnetic Force Between Two Balls | Medium | Core DSA | Implementation / Reasoning | 72.1% | 37.5% | all |
| 2231 | Largest Number After Digit Swaps by Parity | Easy | Core DSA | Implementation / Reasoning | 65.4% | 37.5% | all |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 37.5% | all |
| 692 | Top K Frequent Words | Medium | Strings; Heap | Hashing / Sliding Window; Priority Queue | 60.2% | 37.5% | all |
| 255 | Verify Preorder Sequence in Binary Search Tree | Medium | Trees; Binary Search | DFS / BFS; Binary Search | 51.8% | 37.5% | all |
| 329 | Longest Increasing Path in a Matrix | Hard | Arrays; Dynamic Programming | Sorting / Prefix / Scan; State Transition | 56.6% | 37.5% | all |
| 366 | Find Leaves of Binary Tree | Medium | Trees | DFS / BFS | 81.3% | 37.5% | all |
| 1200 | Minimum Absolute Difference | Easy | Arrays | Sorting / Prefix / Scan | 75.1% | 37.5% | all |
| 134 | Gas Station | Medium | Greedy | Greedy | 48.0% | 37.5% | all |
| 300 | Longest Increasing Subsequence | Medium | Dynamic Programming | State Transition | 59.4% | 37.5% | all |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 37.5% | all |
| 767 | Reorganize String | Medium | Strings | Hashing / Sliding Window | 57.1% | 37.5% | all |
| 1944 | Number of Visible People in a Queue | Hard | Stack / Queue | Monotonic Stack / Simulation | 73.1% | 37.5% | all |
| 1046 | Last Stone Weight | Easy | Core DSA | Implementation / Reasoning | 66.5% | 37.5% | all |
| 1004 | Max Consecutive Ones III | Medium | Core DSA | Implementation / Reasoning | 67.7% | 37.5% | all |
| 4 | Median of Two Sorted Arrays | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 46.6% | 37.5% | all |
| 1335 | Minimum Difficulty of a Job Schedule | Hard | Arrays | Sorting / Prefix / Scan | 59.8% | 37.5% | all |
| 465 | Optimal Account Balancing | Hard | Core DSA | Implementation / Reasoning | 50.5% | 37.5% | all |
| 21 | Merge Two Sorted Lists | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 68.3% | 37.5% | all |
| 125 | Valid Palindrome | Easy | Strings | Hashing / Sliding Window | 53.3% | 37.5% | all |
| 894 | All Possible Full Binary Trees | Medium | Trees | DFS / BFS | 82.8% | 37.5% | all |
| 545 | Boundary of Binary Tree | Medium | Trees | DFS / BFS | 48.1% | 37.5% | all |
| 2451 | Odd String Difference | Easy | Strings | Hashing / Sliding Window | 62.0% | 37.5% | all |
| 1209 | Remove All Adjacent Duplicates in String II | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 61.3% | 37.5% | all |
| 743 | Network Delay Time | Medium | Graphs | BFS / DFS / Topological Sort | 60.4% | 37.5% | all |
| 332 | Reconstruct Itinerary | Hard | Core DSA | Implementation / Reasoning | 44.6% | 37.5% | all |
| 268 | Missing Number | Easy | Arrays | Sorting / Prefix / Scan | 72.0% | 37.5% | all |
| 1438 | Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | Arrays | Sorting / Prefix / Scan | 57.7% | 37.5% | all |
| 12 | Integer to Roman | Medium | Strings | Hashing / Sliding Window | 71.0% | 25.0% | all |
| 13 | Roman to Integer | Easy | Strings | Hashing / Sliding Window | 66.6% | 25.0% | all |
| 39 | Combination Sum | Medium | Arrays; Backtracking | Sorting / Prefix / Scan; Backtracking | 76.5% | 25.0% | all |
| 221 | Maximal Square | Medium | Core DSA | Implementation / Reasoning | 50.3% | 25.0% | all |
| 238 | Product of Array Except Self | Medium | Arrays | Sorting / Prefix / Scan | 68.9% | 25.0% | all |
| 283 | Move Zeroes | Easy | Core DSA | Two Pointers | 63.8% | 25.0% | all |
| 2296 | Design a Text Editor | Hard | Design | Data Structure Design | 50.7% | 25.0% | all |
| 370 | Range Addition | Medium | Core DSA | Implementation / Reasoning | 73.0% | 25.0% | all |
| 410 | Split Array Largest Sum | Hard | Arrays | Sorting / Prefix / Scan | 60.4% | 25.0% | all |
| 621 | Task Scheduler | Medium | Greedy | Greedy | 63.1% | 25.0% | all |
| 494 | Target Sum | Medium | Arrays | Sorting / Prefix / Scan | 52.2% | 25.0% | all |
| 831 | Masking Personal Information | Medium | Core DSA | Implementation / Reasoning | 55.2% | 25.0% | all |
| 152 | Maximum Product Subarray | Medium | Arrays | Sorting / Prefix / Scan | 36.4% | 25.0% | all |
| 2025 | Maximum Number of Ways to Partition an Array | Hard | Arrays; Dynamic Programming | Sorting / Prefix / Scan; State Transition | 35.8% | 25.0% | 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% | 25.0% | all |
| 224 | Basic Calculator | Hard | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 25.0% | all |
| 973 | K Closest Points to Origin | Medium | Core DSA | Implementation / Reasoning | 69.0% | 25.0% | all |
| 636 | Exclusive Time of Functions | Medium | Core DSA | Implementation / Reasoning | 66.2% | 25.0% | all |
| 2515 | Shortest Distance to Target String in a Circular Array | Easy | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 65.2% | 25.0% | all |
| 289 | Game of Life | Medium | Core DSA | Implementation / Reasoning | 72.6% | 25.0% | all |
| 437 | Path Sum III | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 46.4% | 25.0% | all |
| 135 | Candy | Hard | Core DSA | Implementation / Reasoning | 48.5% | 25.0% | all |
| 2008 | Maximum Earnings From Taxi | Medium | Arrays | Sorting / Prefix / Scan | 46.5% | 25.0% | all |
| 1481 | Least Number of Unique Integers after K Removals | Medium | Core DSA | Implementation / Reasoning | 63.8% | 25.0% | all |
| 844 | Backspace String Compare | Easy | Strings | Hashing / Sliding Window | 49.9% | 25.0% | all |
| 353 | Design Snake Game | Medium | Design | Data Structure Design | 40.0% | 25.0% | all |
| 724 | Find Pivot Index | Easy | Core DSA | Implementation / Reasoning | 62.7% | 25.0% | all |
| 535 | Encode and Decode TinyURL | Medium | Dynamic Programming | State Transition | 86.6% | 25.0% | all |
| 768 | Max Chunks To Make Sorted II | Hard | Arrays | Sorting / Prefix / Scan | 54.8% | 25.0% | all |
| 815 | Bus Routes | Hard | Core DSA | Implementation / Reasoning | 47.3% | 25.0% | all |
| 2918 | Minimum Equal Sum of Two Arrays After Replacing Zeros | Medium | Arrays | Sorting / Prefix / Scan | 50.2% | 25.0% | all |
| 85 | Maximal Rectangle | Hard | Core DSA | Implementation / Reasoning | 58.8% | 25.0% | all |
| 337 | House Robber III | Medium | Dynamic Programming | State Transition | 55.9% | 25.0% | all |
| 2345 | Finding the Number of Visible Mountains | Medium | Core DSA | Implementation / Reasoning | 37.3% | 25.0% | all |
| 1319 | Number of Operations to Make Network Connected | Medium | Graphs | BFS / DFS / Topological Sort | 66.5% | 25.0% | all |
| 703 | Kth Largest Element in a Stream | Easy | Heap | Priority Queue | 61.0% | 25.0% | all |
| 652 | Find Duplicate Subtrees | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 60.7% | 25.0% | all |
| 630 | Course Schedule III | Hard | Graphs | BFS / DFS / Topological Sort | 41.7% | 25.0% | all |
| 2065 | Maximum Path Quality of a Graph | Hard | Arrays; Graphs | Sorting / Prefix / Scan; BFS / DFS / Topological Sort | 62.2% | 25.0% | all |
| 416 | Partition Equal Subset Sum | Medium | Arrays; Dynamic Programming | Sorting / Prefix / Scan; State Transition | 49.5% | 25.0% | all |
| 678 | Valid Parenthesis String | Medium | Strings | Hashing / Sliding Window | 40.1% | 25.0% | all |
| 1245 | Tree Diameter | Medium | Trees | DFS / BFS | 61.3% | 25.0% | all |
| 144 | Binary Tree Preorder Traversal | Easy | Trees | DFS / BFS | 75.8% | 25.0% | all |
| 2434 | Using a Robot to Print the Lexicographically Smallest String | Medium | Strings; Graphs | Hashing / Sliding Window; BFS / DFS / Topological Sort | 62.3% | 25.0% | all |
| 3170 | Lexicographically Minimum String After Removing Stars | Medium | Arrays; Strings; Graphs | Sorting / Prefix / Scan; Hashing / Sliding Window; BFS / DFS / Topological Sort | 51.0% | 25.0% | all |
| 2062 | Count Vowel Substrings of a String | Easy | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 73.2% | 25.0% | all |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 25.0% | all |
| 287 | Find the Duplicate Number | Medium | Arrays | Sorting / Prefix / Scan | 64.3% | 25.0% | all |
| 3366 | Minimum Array Sum | Medium | Arrays | Sorting / Prefix / Scan | 31.4% | 25.0% | all |
| 312 | Burst Balloons | Hard | Core DSA | Implementation / Reasoning | 63.5% | 25.0% | all |
| 658 | Find K Closest Elements | Medium | Core DSA | Implementation / Reasoning | 49.7% | 25.0% | all |
| 518 | Coin Change II | Medium | Dynamic Programming | State Transition | 60.0% | 25.0% | all |
| 451 | Sort Characters By Frequency | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 75.3% | 25.0% | all |
| 981 | Time Based Key-Value Store | Medium | Core DSA | Implementation / Reasoning | 49.9% | 25.0% | all |
| 987 | Vertical Order Traversal of a Binary Tree | Hard | Trees | DFS / BFS | 53.8% | 25.0% | all |
| 727 | Minimum Window Subsequence | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 43.8% | 25.0% | all |
| 480 | Sliding Window Median | Hard | Heap | Priority Queue; Sliding Window | 39.0% | 25.0% | all |