259 curated coding interview questions directly asked in Goldman Sachs technical rounds, sorted by frequency with recency and difficulty diagnostics.
Showing top 200 of 259 questions. View all 259 in the interactive tracker.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 100.0% | 30d |
| 166 | Fraction to Recurring Decimal | Medium | Core DSA | Implementation / Reasoning | 30.9% | 87.5% | 30d |
| 1086 | High Five | Easy | Core DSA | Implementation / Reasoning | 74.2% | 75.0% | 30d |
| 4 | Median of Two Sorted Arrays | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 46.6% | 75.0% | 3m |
| 11 | Container With Most Water | Medium | Core DSA | Two Pointers | 60.0% | 75.0% | 6m |
| 443 | String Compression | Medium | Strings | Hashing / Sliding Window | 60.0% | 62.5% | 3m |
| 64 | Minimum Path Sum | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 68.2% | 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 |
| 15 | 3Sum | Medium | Arrays | Sorting / Prefix / Scan | 39.1% | 62.5% | 3m |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 62.5% | 3m |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 62.5% | 3m |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 62.5% | 3m |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 62.5% | 3m |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 62.5% | 3m |
| 387 | First Unique Character in a String | Easy | Strings | Hashing / Sliding Window | 65.5% | 62.5% | 3m |
| 657 | Robot Return to Origin | Easy | Core DSA | Implementation / Reasoning | 78.1% | 62.5% | 3m |
| 1209 | Remove All Adjacent Duplicates in String II | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 61.3% | 62.5% | 6m |
| 945 | Minimum Increment to Make Array Unique | Medium | Arrays | Sorting / Prefix / Scan | 60.7% | 62.5% | 6m |
| 134 | Gas Station | Medium | Greedy | Greedy | 48.0% | 62.5% | 6m |
| 1665 | Minimum Initial Energy to Finish Tasks | Hard | Arrays | Sorting / Prefix / Scan | 76.4% | 62.5% | 6m |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 62.5% | all |
| 91 | Decode Ways | Medium | Dynamic Programming | State Transition | 38.0% | 62.5% | all |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 62.5% | all |
| 688 | Knight Probability in Chessboard | Medium | Core DSA | Implementation / Reasoning | 57.0% | 62.5% | all |
| 1041 | Robot Bounded In Circle | Medium | Core DSA | Implementation / Reasoning | 56.5% | 62.5% | all |
| 3167 | Better Compression of String | Medium | Strings | Hashing / Sliding Window | 75.3% | 62.5% | all |
| 1823 | Find the Winner of the Circular Game | Medium | Core DSA | Implementation / Reasoning | 82.2% | 62.5% | all |
| 465 | Optimal Account Balancing | Hard | Core DSA | Implementation / Reasoning | 50.5% | 50.0% | 6m |
| 69 | Sqrt(x) | Easy | Binary Search | Binary Search | 41.8% | 50.0% | 6m |
| 457 | Circular Array Loop | Medium | Arrays | Sorting / Prefix / Scan | 37.5% | 50.0% | 6m |
| 695 | Max Area of Island | Medium | Graphs | BFS / DFS / Topological Sort | 74.0% | 50.0% | 6m |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 50.0% | 6m |
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 50.0% | 6m |
| 875 | Koko Eating Bananas | Medium | Binary Search | Binary Search | 50.0% | 50.0% | 6m |
| 1094 | Car Pooling | Medium | Core DSA | Implementation / Reasoning | 56.4% | 50.0% | 6m |
| 62 | Unique Paths | Medium | Core DSA | Implementation / Reasoning | 66.8% | 50.0% | 6m |
| 934 | Shortest Bridge | Medium | Core DSA | Implementation / Reasoning | 59.5% | 50.0% | 6m |
| 13 | Roman to Integer | Easy | Strings | Hashing / Sliding Window | 66.6% | 50.0% | 6m |
| 1472 | Design Browser History | Medium | Design | Data Structure Design | 78.3% | 50.0% | 6m |
| 739 | Daily Temperatures | Medium | Stack / Queue | Monotonic Stack / Simulation | 68.7% | 50.0% | 6m |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 50.0% | all |
| 55 | Jump Game | Medium | Greedy | Greedy | 40.9% | 50.0% | all |
| 118 | Pascal's Triangle | Easy | Core DSA | Implementation / Reasoning | 78.9% | 50.0% | all |
| 122 | Best Time to Buy and Sell Stock II | Medium | Core DSA | Implementation / Reasoning | 71.1% | 50.0% | all |
| 2087 | Minimum Cost Homecoming of a Robot in a Grid | Medium | Arrays | Sorting / Prefix / Scan | 51.7% | 50.0% | all |
| 153 | Find Minimum in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 54.7% | 50.0% | all |
| 2097 | Valid Arrangement of Pairs | Hard | Strings | Hashing / Sliding Window | 66.6% | 50.0% | all |
| 215 | Kth Largest Element in an Array | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 68.9% | 50.0% | all |
| 2154 | Keep Multiplying Found Values by Two | Easy | Core DSA | Implementation / Reasoning | 75.0% | 50.0% | all |
| 2266 | Count Number of Texts | Medium | Core DSA | Implementation / Reasoning | 50.2% | 50.0% | all |
| 2300 | Successful Pairs of Spells and Potions | Medium | Core DSA | Implementation / Reasoning | 49.6% | 50.0% | all |
| 2420 | Find All Good Indices | Medium | Core DSA | Implementation / Reasoning | 41.0% | 50.0% | all |
| 2438 | Range Product Queries of Powers | Medium | Arrays | Sorting / Prefix / Scan | 61.3% | 50.0% | all |
| 2446 | Determine if Two Events Have Conflict | Easy | Core DSA | Implementation / Reasoning | 53.3% | 50.0% | all |
| 2484 | Count Palindromic Subsequences | Hard | Core DSA | Implementation / Reasoning | 41.2% | 50.0% | all |
| 2550 | Count Collisions of Monkeys on a Polygon | Medium | Core DSA | Implementation / Reasoning | 30.1% | 50.0% | all |
| 706 | Design HashMap | Easy | Design | Data Structure Design | 66.6% | 50.0% | all |
| 862 | Shortest Subarray with Sum at Least K | Hard | Arrays | Sorting / Prefix / Scan | 32.8% | 50.0% | all |
| 931 | Minimum Falling Path Sum | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 60.8% | 50.0% | all |
| 1010 | Pairs of Songs With Total Durations Divisible by 60 | Medium | Core DSA | Implementation / Reasoning | 53.5% | 50.0% | all |
| 1109 | Corporate Flight Bookings | Medium | Core DSA | Implementation / Reasoning | 67.3% | 50.0% | all |
| 1116 | Print Zero Even Odd | Medium | Core DSA | Implementation / Reasoning | 65.5% | 50.0% | all |
| 3001 | Minimum Moves to Capture The Queen | Medium | Arrays | Sorting / Prefix / Scan | 22.5% | 50.0% | all |
| 2191 | Sort the Jumbled Numbers | Medium | Arrays | Sorting / Prefix / Scan | 60.0% | 50.0% | all |
| 1427 | Perform String Shifts | Easy | Strings | Hashing / Sliding Window | 56.0% | 50.0% | all |
| 3168 | Minimum Number of Chairs in a Waiting Room | Easy | Arrays | Sorting / Prefix / Scan | 79.4% | 50.0% | all |
| 1750 | Minimum Length of String After Deleting Similar Ends | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 56.1% | 50.0% | all |
| 1771 | Maximize Palindrome Length From Subsequences | Hard | Strings | Hashing / Sliding Window | 38.5% | 50.0% | all |
| 3437 | Permutations III | Medium | Backtracking | Backtracking | 86.9% | 50.0% | all |
| 3494 | Find the Minimum Amount of Time to Brew Potions | Medium | Arrays | Sorting / Prefix / Scan | 62.7% | 50.0% | all |
| 2 | Add Two Numbers | Medium | Core DSA | Implementation / Reasoning | 48.5% | 37.5% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 37.5% | all |
| 8 | String to Integer (atoi) | Medium | Strings | Hashing / Sliding Window | 21.0% | 37.5% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 37.5% | all |
| 50 | Pow(x, n) | Medium | Core DSA | Implementation / Reasoning | 38.7% | 37.5% | all |
| 51 | N-Queens | Hard | Backtracking | Backtracking | 75.5% | 37.5% | all |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 37.5% | all |
| 70 | Climbing Stairs | Easy | Dynamic Programming | State Transition | 54.1% | 37.5% | all |
| 73 | Set Matrix Zeroes | Medium | Arrays | Sorting / Prefix / Scan | 62.9% | 37.5% | all |
| 135 | Candy | Hard | Core DSA | Implementation / Reasoning | 48.5% | 37.5% | all |
| 141 | Linked List Cycle | Easy | Linked List | Two Pointers | 54.3% | 37.5% | all |
| 152 | Maximum Product Subarray | Medium | Arrays | Sorting / Prefix / Scan | 36.4% | 37.5% | all |
| 160 | Intersection of Two Linked Lists | Easy | Linked List | Two Pointers | 63.7% | 37.5% | all |
| 162 | Find Peak Element | Medium | Binary Search | Binary Search | 47.0% | 37.5% | all |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 37.5% | all |
| 209 | Minimum Size Subarray Sum | Medium | Arrays | Sorting / Prefix / Scan | 51.7% | 37.5% | all |
| 218 | The Skyline Problem | Hard | Core DSA | Implementation / Reasoning | 45.4% | 37.5% | all |
| 238 | Product of Array Except Self | Medium | Arrays | Sorting / Prefix / Scan | 68.9% | 37.5% | all |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 37.5% | all |
| 295 | Find Median from Data Stream | Hard | Heap | Priority Queue | 54.5% | 37.5% | all |
| 326 | Power of Three | Easy | Core DSA | Implementation / Reasoning | 51.1% | 37.5% | all |
| 74 | Search a 2D Matrix | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 53.9% | 37.5% | all |
| 2375 | Construct Smallest Number From DI String | Medium | Strings | Hashing / Sliding Window | 85.6% | 37.5% | all |
| 421 | Maximum XOR of Two Numbers in an Array | Medium | Arrays | Sorting / Prefix / Scan | 53.5% | 37.5% | all |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 37.5% | all |
| 647 | Palindromic Substrings | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 72.8% | 37.5% | all |
| 735 | Asteroid Collision | Medium | Core DSA | Implementation / Reasoning | 47.9% | 37.5% | all |
| 780 | Reaching Points | Hard | Core DSA | Implementation / Reasoning | 34.4% | 37.5% | all |
| 844 | Backspace String Compare | Easy | Strings | Hashing / Sliding Window | 49.9% | 37.5% | all |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 37.5% | all |
| 1011 | Capacity To Ship Packages Within D Days | Medium | Binary Search | Binary Search | 73.9% | 37.5% | all |
| 1395 | Count Number of Teams | Medium | Core DSA | Implementation / Reasoning | 70.2% | 37.5% | all |
| 1413 | Minimum Value to Get Positive Step by Step Sum | Easy | Arrays | Sorting / Prefix / Scan | 64.7% | 37.5% | all |
| 1832 | Check if the Sentence Is Pangram | Easy | Core DSA | Implementation / Reasoning | 84.2% | 37.5% | all |
| 424 | Longest Repeating Character Replacement | Medium | Strings | Hashing / Sliding Window | 59.7% | 37.5% | all |
| 273 | Integer to English Words | Hard | Strings | Hashing / Sliding Window | 35.0% | 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 |
| 641 | Design Circular Deque | Medium | Design | Data Structure Design | 64.7% | 37.5% | all |
| 1235 | Maximum Profit in Job Scheduling | Hard | Arrays | Sorting / Prefix / Scan | 54.7% | 37.5% | all |
| 206 | Reverse Linked List | Easy | Linked List | Two Pointers | 80.6% | 37.5% | all |
| 1004 | Max Consecutive Ones III | Medium | Core DSA | Implementation / Reasoning | 67.7% | 37.5% | all |
| 22 | Generate Parentheses | Medium | Strings | Hashing / Sliding Window | 78.7% | 37.5% | all |
| 752 | Open the Lock | Medium | Core DSA | Implementation / Reasoning | 61.3% | 37.5% | all |
| 128 | Longest Consecutive Sequence | Medium | Core DSA | Implementation / Reasoning | 47.1% | 37.5% | all |
| 1446 | Consecutive Characters | Easy | Strings | Hashing / Sliding Window | 60.4% | 37.5% | all |
| 414 | Third Maximum Number | Easy | Arrays | Sorting / Prefix / Scan | 39.4% | 37.5% | all |
| 283 | Move Zeroes | Easy | Core DSA | Two Pointers | 63.8% | 37.5% | all |
| 968 | Binary Tree Cameras | Hard | Trees | DFS / BFS | 47.9% | 37.5% | all |
| 322 | Coin Change | Medium | Dynamic Programming | State Transition | 48.4% | 37.5% | all |
| 3371 | Identify the Largest Outlier in an Array | Medium | Arrays | Sorting / Prefix / Scan | 36.3% | 37.5% | all |
| 210 | Course Schedule II | Medium | Graphs | BFS / DFS / Topological Sort | 55.5% | 37.5% | all |
| 1343 | Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold | Medium | Arrays | Sorting / Prefix / Scan | 72.9% | 37.5% | all |
| 85 | Maximal Rectangle | Hard | Core DSA | Implementation / Reasoning | 58.8% | 37.5% | all |
| 354 | Russian Doll Envelopes | Hard | Core DSA | Implementation / Reasoning | 37.9% | 37.5% | all |
| 1478 | Allocate Mailboxes | Hard | Core DSA | Implementation / Reasoning | 56.6% | 37.5% | all |
| 611 | Valid Triangle Number | Medium | Strings | Hashing / Sliding Window | 56.9% | 37.5% | all |
| 621 | Task Scheduler | Medium | Greedy | Greedy | 63.1% | 37.5% | all |
| 1219 | Path with Maximum Gold | Medium | Arrays | Sorting / Prefix / Scan | 68.4% | 37.5% | all |
| 25 | Reverse Nodes in k-Group | Hard | Trees; Linked List | DFS / BFS; Two Pointers | 66.1% | 37.5% | all |
| 84 | Largest Rectangle in Histogram | Hard | Core DSA | Implementation / Reasoning | 49.9% | 37.5% | all |
| 3649 | Number of Perfect Pairs | Medium | Core DSA | Implementation / Reasoning | 34.1% | 37.5% | all |
| 88 | Merge Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 54.9% | 37.5% | all |
| 3885 | Design Event Manager | Medium | Design | Data Structure Design | 50.8% | 37.5% | all |
| 12 | Integer to Roman | Medium | Strings | Hashing / Sliding Window | 71.0% | 25.0% | all |
| 17 | Letter Combinations of a Phone Number | Medium | Strings; Backtracking | Hashing / Sliding Window; Backtracking | 66.1% | 25.0% | all |
| 21 | Merge Two Sorted Lists | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 68.3% | 25.0% | all |
| 31 | Next Permutation | Medium | Backtracking | Backtracking | 45.3% | 25.0% | all |
| 41 | First Missing Positive | Hard | Arrays | Sorting / Prefix / Scan | 42.9% | 25.0% | all |
| 45 | Jump Game II | Medium | Greedy | Greedy | 42.9% | 25.0% | all |
| 48 | Rotate Image | Medium | Arrays | Sorting / Prefix / Scan | 80.1% | 25.0% | all |
| 79 | Word Search | Medium | Strings; Binary Search | Hashing / Sliding Window; Binary Search | 47.4% | 25.0% | all |
| 119 | Pascal's Triangle II | Easy | Core DSA | Implementation / Reasoning | 67.5% | 25.0% | all |
| 143 | Reorder List | Medium | Linked List | Two Pointers | 65.3% | 25.0% | all |
| 188 | Best Time to Buy and Sell Stock IV | Hard | Core DSA | Implementation / Reasoning | 50.1% | 25.0% | all |
| 221 | Maximal Square | Medium | Core DSA | Implementation / Reasoning | 50.3% | 25.0% | all |
| 268 | Missing Number | Easy | Arrays | Sorting / Prefix / Scan | 72.0% | 25.0% | all |
| 287 | Find the Duplicate Number | Medium | Arrays | Sorting / Prefix / Scan | 64.3% | 25.0% | all |
| 300 | Longest Increasing Subsequence | Medium | Dynamic Programming | State Transition | 59.4% | 25.0% | all |
| 340 | Longest Substring with At Most K Distinct Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 50.0% | 25.0% | all |
| 344 | Reverse String | Easy | Strings | Hashing / Sliding Window | 80.8% | 25.0% | all |
| 394 | Decode String | Medium | Strings; Dynamic Programming; Stack / Queue | Hashing / Sliding Window; State Transition; Monotonic Stack / Simulation | 62.6% | 25.0% | all |
| 452 | Minimum Number of Arrows to Burst Balloons | Medium | Arrays | Sorting / Prefix / Scan | 61.4% | 25.0% | all |
| 496 | Next Greater Element I | Easy | Stack / Queue | Monotonic Stack / Simulation | 76.1% | 25.0% | all |
| 567 | Permutation in String | Medium | Strings; Backtracking | Hashing / Sliding Window; Sliding Window; Backtracking | 48.9% | 25.0% | all |
| 2719 | Count of Integers | Hard | Core DSA | Implementation / Reasoning | 38.6% | 25.0% | all |
| 767 | Reorganize String | Medium | Strings | Hashing / Sliding Window | 57.1% | 25.0% | all |
| 871 | Minimum Number of Refueling Stops | Hard | Arrays | Sorting / Prefix / Scan | 41.4% | 25.0% | all |
| 1396 | Design Underground System | Medium | Design | Data Structure Design | 74.5% | 25.0% | all |
| 205 | Isomorphic Strings | Easy | Strings | Hashing / Sliding Window | 48.4% | 25.0% | all |
| 139 | Word Break | Medium | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 49.5% | 25.0% | all |
| 564 | Find the Closest Palindrome | Hard | Strings | Hashing / Sliding Window | 32.0% | 25.0% | all |
| 37 | Sudoku Solver | Hard | Backtracking | Backtracking | 65.5% | 25.0% | all |
| 98 | Validate Binary Search Tree | Medium | Strings; Trees; Binary Search | Hashing / Sliding Window; DFS / BFS; Binary Search | 35.8% | 25.0% | all |
| 264 | Ugly Number II | Medium | Core DSA | Implementation / Reasoning | 49.6% | 25.0% | all |
| 540 | Single Element in a Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 59.3% | 25.0% | all |
| 412 | Fizz Buzz | Easy | Core DSA | Implementation / Reasoning | 75.5% | 25.0% | all |
| 93 | Restore IP Addresses | Medium | Core DSA | Implementation / Reasoning | 56.0% | 25.0% | all |
| 733 | Flood Fill | Easy | Core DSA | Implementation / Reasoning | 68.3% | 25.0% | all |
| 325 | Maximum Size Subarray Sum Equals k | Medium | Arrays | Sorting / Prefix / Scan | 50.9% | 25.0% | all |
| 125 | Valid Palindrome | Easy | Strings | Hashing / Sliding Window | 53.3% | 25.0% | all |
| 124 | Binary Tree Maximum Path Sum | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 42.3% | 25.0% | all |
| 909 | Snakes and Ladders | Medium | Core DSA | Implementation / Reasoning | 48.1% | 25.0% | all |
| 78 | Subsets | Medium | Backtracking | Backtracking | 82.3% | 25.0% | all |
| 171 | Excel Sheet Column Number | Easy | Core DSA | Implementation / Reasoning | 67.8% | 25.0% | all |
| 1752 | Check if Array Is Sorted and Rotated | Easy | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 57.2% | 25.0% | all |
| 918 | Maximum Sum Circular Subarray | Medium | Arrays | Sorting / Prefix / Scan | 50.2% | 25.0% | all |
| 1909 | Remove One Element to Make the Array Strictly Increasing | Easy | Arrays | Sorting / Prefix / Scan | 29.8% | 25.0% | all |
| 460 | LFU Cache | Hard | Design | Data Structure Design | 49.2% | 25.0% | all |
| 289 | Game of Life | Medium | Core DSA | Implementation / Reasoning | 72.6% | 25.0% | all |
| 59 | Spiral Matrix II | Medium | Arrays | Sorting / Prefix / Scan | 75.1% | 25.0% | all |
| 336 | Palindrome Pairs | Hard | Strings | Hashing / Sliding Window | 37.2% | 25.0% | all |
| 456 | 132 Pattern | Medium | Strings | Hashing / Sliding Window | 34.8% | 25.0% | all |
| 1838 | Frequency of the Most Frequent Element | Medium | Core DSA | Implementation / Reasoning | 44.8% | 25.0% | all |
| 2043 | Simple Bank System | Medium | Core DSA | Implementation / Reasoning | 69.7% | 25.0% | all |
| 227 | Basic Calculator II | Medium | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 25.0% | all |
| 1910 | Remove All Occurrences of a Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 78.5% | 25.0% | all |
| 112 | Path Sum | Easy | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 54.9% | 25.0% | all |
| 1448 | Count Good Nodes in Binary Tree | Medium | Trees | DFS / BFS | 73.9% | 25.0% | all |
| 653 | Two Sum IV - Input is a BST | Easy | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS; Two Pointers | 63.3% | 25.0% | all |
| 503 | Next Greater Element II | Medium | Stack / Queue | Monotonic Stack / Simulation | 68.4% | 25.0% | all |
| 779 | K-th Symbol in Grammar | Medium | Core DSA | Implementation / Reasoning | 48.3% | 25.0% | all |
| 208 | Implement Trie (Prefix Tree) | Medium | Trees | DFS / BFS | 69.5% | 25.0% | all |
| 2402 | Meeting Rooms III | Hard | Greedy | Greedy | 51.5% | 25.0% | all |
| 622 | Design Circular Queue | Medium | Stack / Queue; Design | Monotonic Stack / Simulation; Data Structure Design | 54.7% | 25.0% | all |
| 2734 | Lexicographically Smallest String After Substring Operation | Medium | Strings; Trees; Graphs | Hashing / Sliding Window; DFS / BFS; BFS / DFS / Topological Sort | 34.9% | 25.0% | all |
| 277 | Find the Celebrity | Medium | Core DSA | Implementation / Reasoning | 49.0% | 25.0% | all |
| 120 | Triangle | Medium | Core DSA | Implementation / Reasoning | 59.9% | 25.0% | all |
| 1091 | Shortest Path in Binary Matrix | Medium | Arrays | Sorting / Prefix / Scan | 51.5% | 25.0% | all |
| 815 | Bus Routes | Hard | Core DSA | Implementation / Reasoning | 47.3% | 25.0% | all |
| 225 | Implement Stack using Queues | Easy | Stack / Queue | Monotonic Stack / Simulation | 69.9% | 25.0% | all |