156 curated coding interview questions directly asked in Adobe technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 100.0% | 3m |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 87.5% | 3m |
| 2 | Add Two Numbers | Medium | Core DSA | Implementation / Reasoning | 48.5% | 87.5% | all |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 87.5% | all |
| 4 | Median of Two Sorted Arrays | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 46.6% | 87.5% | all |
| 15 | 3Sum | Medium | Arrays | Sorting / Prefix / Scan | 39.1% | 87.5% | all |
| 70 | Climbing Stairs | Easy | Dynamic Programming | State Transition | 54.1% | 87.5% | all |
| 169 | Majority Element | Easy | Core DSA | Implementation / Reasoning | 66.3% | 87.5% | all |
| 195 | Tenth Line | Easy | Core DSA | Implementation / Reasoning | 36.8% | 87.5% | all |
| 206 | Reverse Linked List | Easy | Linked List | Two Pointers | 80.6% | 87.5% | all |
| 237 | Delete Node in a Linked List | Medium | Trees; Linked List | DFS / BFS; Two Pointers | 83.9% | 87.5% | all |
| 258 | Add Digits | Easy | Core DSA | Implementation / Reasoning | 68.9% | 87.5% | all |
| 292 | Nim Game | Easy | Core DSA | Implementation / Reasoning | 59.8% | 87.5% | all |
| 703 | Kth Largest Element in a Stream | Easy | Heap | Priority Queue | 61.0% | 87.5% | all |
| 793 | Preimage Size of Factorial Zeroes Function | Hard | Core DSA | Implementation / Reasoning | 47.0% | 87.5% | all |
| 795 | Number of Subarrays with Bounded Maximum | Medium | Arrays | Sorting / Prefix / Scan | 55.0% | 87.5% | all |
| 908 | Smallest Range I | Easy | Core DSA | Implementation / Reasoning | 73.6% | 87.5% | all |
| 910 | Smallest Range II | Medium | Core DSA | Implementation / Reasoning | 37.9% | 87.5% | all |
| 1190 | Reverse Substrings Between Each Pair of Parentheses | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 72.0% | 87.5% | all |
| 1916 | Count Ways to Build Rooms in an Ant Colony | Hard | Core DSA | Implementation / Reasoning | 51.4% | 87.5% | all |
| 2055 | Plates Between Candles | Medium | Core DSA | Implementation / Reasoning | 47.5% | 87.5% | all |
| 2143 | Choose Numbers From Two Arrays in Range | Hard | Arrays | Sorting / Prefix / Scan | 52.8% | 87.5% | all |
| 2328 | Number of Increasing Paths in a Grid | Hard | Core DSA | Implementation / Reasoning | 57.4% | 87.5% | all |
| 2406 | Divide Intervals Into Minimum Number of Groups | Medium | Arrays | Sorting / Prefix / Scan | 63.6% | 87.5% | all |
| 2429 | Minimize XOR | Medium | Core DSA | Implementation / Reasoning | 62.4% | 87.5% | all |
| 2422 | Merge Operations to Turn Array Into a Palindrome | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 68.9% | 87.5% | all |
| 2892 | Minimizing Array After Replacing Pairs With Their Product | Medium | Arrays | Sorting / Prefix / Scan | 40.7% | 87.5% | all |
| 2962 | Count Subarrays Where Max Element Appears at Least K Times | Medium | Arrays | Sorting / Prefix / Scan | 62.4% | 87.5% | all |
| 3173 | Bitwise OR of Adjacent Elements | Easy | Core DSA | Implementation / Reasoning | 94.8% | 87.5% | all |
| 761 | Special Binary String | Hard | Strings | Hashing / Sliding Window | 79.3% | 87.5% | all |
| 124 | Binary Tree Maximum Path Sum | Hard | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 42.3% | 75.0% | 3m |
| 289 | Game of Life | Medium | Core DSA | Implementation / Reasoning | 72.6% | 75.0% | 3m |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 75.0% | 6m |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 75.0% | 6m |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 75.0% | 6m |
| 392 | Is Subsequence | Easy | Core DSA | Implementation / Reasoning | 49.0% | 75.0% | 6m |
| 475 | Heaters | Medium | Core DSA | Implementation / Reasoning | 41.9% | 75.0% | 6m |
| 1482 | Minimum Number of Days to Make m Bouquets | Medium | Arrays | Sorting / Prefix / Scan | 56.6% | 75.0% | 6m |
| 227 | Basic Calculator II | Medium | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 75.0% | 6m |
| 875 | Koko Eating Bananas | Medium | Binary Search | Binary Search | 50.0% | 75.0% | 6m |
| 12 | Integer to Roman | Medium | Strings | Hashing / Sliding Window | 71.0% | 75.0% | all |
| 14 | Longest Common Prefix | Easy | Core DSA | Implementation / Reasoning | 47.6% | 75.0% | all |
| 31 | Next Permutation | Medium | Backtracking | Backtracking | 45.3% | 75.0% | all |
| 55 | Jump Game | Medium | Greedy | Greedy | 40.9% | 75.0% | all |
| 76 | Minimum Window Substring | Hard | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS; Sliding Window | 47.5% | 75.0% | all |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 75.0% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 75.0% | all |
| 3636 | Threshold Majority Queries | Hard | Core DSA | Implementation / Reasoning | 21.9% | 75.0% | all |
| 468 | Validate IP Address | Medium | Strings | Hashing / Sliding Window | 28.3% | 75.0% | all |
| 3736 | Minimum Moves to Equal Array Elements III | Easy | Arrays | Sorting / Prefix / Scan | 81.8% | 75.0% | all |
| 8 | String to Integer (atoi) | Medium | Strings | Hashing / Sliding Window | 21.0% | 62.5% | all |
| 13 | Roman to Integer | Easy | Strings | Hashing / Sliding Window | 66.6% | 62.5% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 62.5% | all |
| 42 | Trapping Rain Water | Hard | Core DSA | Two Pointers | 67.4% | 62.5% | all |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 62.5% | all |
| 74 | Search a 2D Matrix | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 53.9% | 62.5% | all |
| 93 | Restore IP Addresses | Medium | Core DSA | Implementation / Reasoning | 56.0% | 62.5% | all |
| 103 | Binary Tree Zigzag Level Order Traversal | Medium | Trees | DFS / BFS | 63.7% | 62.5% | all |
| 128 | Longest Consecutive Sequence | Medium | Core DSA | Implementation / Reasoning | 47.1% | 62.5% | all |
| 134 | Gas Station | Medium | Greedy | Greedy | 48.0% | 62.5% | all |
| 152 | Maximum Product Subarray | Medium | Arrays | Sorting / Prefix / Scan | 36.4% | 62.5% | all |
| 179 | Largest Number | Medium | Core DSA | Implementation / Reasoning | 43.1% | 62.5% | all |
| 236 | Lowest Common Ancestor of a Binary Tree | Medium | Trees | DFS / BFS | 69.3% | 62.5% | all |
| 239 | Sliding Window Maximum | Hard | Arrays | Sorting / Prefix / Scan; Sliding Window | 48.8% | 62.5% | all |
| 322 | Coin Change | Medium | Dynamic Programming | State Transition | 48.4% | 62.5% | all |
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 62.5% | all |
| 402 | Remove K Digits | Medium | Core DSA | Implementation / Reasoning | 36.9% | 62.5% | all |
| 547 | Number of Provinces | Medium | Core DSA | Implementation / Reasoning | 70.4% | 62.5% | all |
| 904 | Fruit Into Baskets | Medium | Core DSA | Implementation / Reasoning | 51.1% | 62.5% | all |
| 994 | Rotting Oranges | Medium | Core DSA | Implementation / Reasoning | 58.7% | 62.5% | all |
| 2895 | Minimum Processing Time | Medium | Arrays | Sorting / Prefix / Scan | 70.3% | 62.5% | all |
| 2506 | Count Pairs Of Similar Strings | Easy | Strings | Hashing / Sliding Window | 73.7% | 62.5% | all |
| 692 | Top K Frequent Words | Medium | Strings; Heap | Hashing / Sliding Window; Priority Queue | 60.2% | 62.5% | all |
| 1293 | Shortest Path in a Grid with Obstacles Elimination | Hard | Trees | DFS / BFS | 46.3% | 62.5% | all |
| 1636 | Sort Array by Increasing Frequency | Easy | Arrays | Sorting / Prefix / Scan | 80.8% | 62.5% | all |
| 7 | Reverse Integer | Medium | Core DSA | Implementation / Reasoning | 31.9% | 50.0% | all |
| 22 | Generate Parentheses | Medium | Strings | Hashing / Sliding Window | 78.7% | 50.0% | all |
| 27 | Remove Element | Easy | Core DSA | Implementation / Reasoning | 61.8% | 50.0% | all |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 50.0% | all |
| 45 | Jump Game II | Medium | Greedy | Greedy | 42.9% | 50.0% | all |
| 48 | Rotate Image | Medium | Arrays | Sorting / Prefix / Scan | 80.1% | 50.0% | all |
| 51 | N-Queens | Hard | Backtracking | Backtracking | 75.5% | 50.0% | all |
| 102 | Binary Tree Level Order Traversal | Medium | Trees | DFS / BFS | 72.7% | 50.0% | all |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | Trees | DFS / BFS | 68.8% | 50.0% | all |
| 198 | House Robber | Medium | Dynamic Programming | State Transition | 53.2% | 50.0% | all |
| 215 | Kth Largest Element in an Array | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 68.9% | 50.0% | all |
| 238 | Product of Array Except Self | Medium | Arrays | Sorting / Prefix / Scan | 68.9% | 50.0% | all |
| 253 | Meeting Rooms II | Medium | Greedy | Greedy | 52.7% | 50.0% | all |
| 283 | Move Zeroes | Easy | Core DSA | Two Pointers | 63.8% | 50.0% | all |
| 417 | Pacific Atlantic Water Flow | Medium | Core DSA | Implementation / Reasoning | 61.0% | 50.0% | all |
| 528 | Random Pick with Weight | Medium | Core DSA | Implementation / Reasoning | 49.1% | 50.0% | all |
| 1863 | Sum of All Subset XOR Totals | Easy | Arrays | Sorting / Prefix / Scan | 90.1% | 50.0% | all |
| 2385 | Amount of Time for Binary Tree to Be Infected | Medium | Trees | DFS / BFS | 65.4% | 50.0% | all |
| 638 | Shopping Offers | Medium | Core DSA | Implementation / Reasoning | 52.5% | 50.0% | all |
| 329 | Longest Increasing Path in a Matrix | Hard | Arrays; Dynamic Programming | Sorting / Prefix / Scan; State Transition | 56.6% | 50.0% | all |
| 3528 | Unit Conversion I | Medium | Core DSA | Implementation / Reasoning | 54.1% | 50.0% | all |
| 339 | Nested List Weight Sum | Medium | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 86.0% | 50.0% | all |
| 219 | Contains Duplicate II | Easy | Arrays | Sorting / Prefix / Scan | 51.3% | 50.0% | all |
| 11 | Container With Most Water | Medium | Core DSA | Two Pointers | 60.0% | 37.5% | all |
| 25 | Reverse Nodes in k-Group | Hard | Trees; Linked List | DFS / BFS; Two Pointers | 66.1% | 37.5% | all |
| 40 | Combination Sum II | Medium | Arrays; Backtracking | Sorting / Prefix / Scan; Backtracking | 59.5% | 37.5% | all |
| 50 | Pow(x, n) | Medium | Core DSA | Implementation / Reasoning | 38.7% | 37.5% | all |
| 69 | Sqrt(x) | Easy | Binary Search | Binary Search | 41.8% | 37.5% | all |
| 75 | Sort Colors | Medium | Arrays | Sorting / Prefix / Scan | 69.6% | 37.5% | all |
| 83 | Remove Duplicates from Sorted List | Easy | Arrays; Linked List | Sorting / Prefix / Scan; Two Pointers | 56.7% | 37.5% | all |
| 84 | Largest Rectangle in Histogram | Hard | Core DSA | Implementation / Reasoning | 49.9% | 37.5% | all |
| 91 | Decode Ways | Medium | Dynamic Programming | State Transition | 38.0% | 37.5% | all |
| 125 | Valid Palindrome | Easy | Strings | Hashing / Sliding Window | 53.3% | 37.5% | all |
| 127 | Word Ladder | Hard | Strings | Hashing / Sliding Window | 45.6% | 37.5% | all |
| 130 | Surrounded Regions | Medium | Core DSA | Implementation / Reasoning | 45.3% | 37.5% | all |
| 136 | Single Number | Easy | Core DSA | Implementation / Reasoning | 77.7% | 37.5% | all |
| 155 | Min Stack | Medium | Stack / Queue | Monotonic Stack / Simulation | 58.2% | 37.5% | all |
| 167 | Two Sum II - Input Array Is Sorted | Medium | Arrays | Sorting / Prefix / Scan; Two Pointers | 65.1% | 37.5% | all |
| 173 | Binary Search Tree Iterator | Medium | Trees; Binary Search; Design | DFS / BFS; Binary Search; Data Structure Design | 76.5% | 37.5% | all |
| 207 | Course Schedule | Medium | Graphs | BFS / DFS / Topological Sort | 51.4% | 37.5% | all |
| 208 | Implement Trie (Prefix Tree) | Medium | Trees | DFS / BFS | 69.5% | 37.5% | all |
| 217 | Contains Duplicate | Easy | Arrays | Sorting / Prefix / Scan | 64.4% | 37.5% | all |
| 268 | Missing Number | Easy | Arrays | Sorting / Prefix / Scan | 72.0% | 37.5% | all |
| 387 | First Unique Character in a String | Easy | Strings | Hashing / Sliding Window | 65.5% | 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 |
| 424 | Longest Repeating Character Replacement | Medium | Strings | Hashing / Sliding Window | 59.7% | 37.5% | all |
| 540 | Single Element in a Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 59.3% | 37.5% | all |
| 542 | 01 Matrix | Medium | Arrays | Sorting / Prefix / Scan | 53.9% | 37.5% | all |
| 556 | Next Greater Element III | Medium | Stack / Queue | Monotonic Stack / Simulation | 35.3% | 37.5% | all |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 37.5% | all |
| 567 | Permutation in String | Medium | Strings; Backtracking | Hashing / Sliding Window; Sliding Window; Backtracking | 48.9% | 37.5% | all |
| 584 | Find Customer Referee | Easy | Core DSA | Implementation / Reasoning | 72.9% | 37.5% | all |
| 864 | Shortest Path to Get All Keys | Hard | Core DSA | Implementation / Reasoning | 54.6% | 37.5% | all |
| 977 | Squares of a Sorted Array | Easy | Arrays | Sorting / Prefix / Scan | 73.8% | 37.5% | all |
| 993 | Cousins in Binary Tree | Easy | Trees | DFS / BFS | 59.3% | 37.5% | all |
| 1268 | Search Suggestions System | Medium | Binary Search | Binary Search | 65.2% | 37.5% | all |
| 1581 | Customer Who Visited but Did Not Make Any Transactions | Easy | Core DSA | Implementation / Reasoning | 67.7% | 37.5% | all |
| 2704 | To Be Or Not To Be | Easy | Core DSA | Implementation / Reasoning | 63.4% | 37.5% | all |
| 2134 | Minimum Swaps to Group All 1's Together II | Medium | Arrays | Sorting / Prefix / Scan | 65.6% | 37.5% | all |
| 224 | Basic Calculator | Hard | Stack / Queue | Monotonic Stack / Simulation | 46.9% | 37.5% | all |
| 307 | Range Sum Query - Mutable | Medium | Arrays | Sorting / Prefix / Scan | 43.1% | 37.5% | all |
| 525 | Contiguous Array | Medium | Arrays | Sorting / Prefix / Scan | 51.3% | 37.5% | all |
| 3046 | Split the Array | Easy | Arrays | Sorting / Prefix / Scan | 61.3% | 37.5% | all |
| 355 | Design Twitter | Medium | Design | Data Structure Design | 44.7% | 37.5% | all |
| 2536 | Increment Submatrices by One | Medium | Core DSA | Implementation / Reasoning | 73.8% | 37.5% | all |
| 1004 | Max Consecutive Ones III | Medium | Core DSA | Implementation / Reasoning | 67.7% | 37.5% | all |
| 222 | Count Complete Tree Nodes | Easy | Trees | DFS / BFS | 72.6% | 37.5% | all |
| 669 | Trim a Binary Search Tree | Medium | Trees; Binary Search | DFS / BFS; Binary Search | 66.7% | 37.5% | all |
| 2275 | Largest Combination With Bitwise AND Greater Than Zero | Medium | Backtracking | Backtracking | 80.8% | 37.5% | all |
| 545 | Boundary of Binary Tree | Medium | Trees | DFS / BFS | 48.1% | 37.5% | all |
| 1507 | Reformat Date | Easy | Core DSA | Implementation / Reasoning | 68.5% | 37.5% | all |
| 1963 | Minimum Number of Swaps to Make the String Balanced | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 78.0% | 37.5% | all |
| 2291 | Maximum Profit From Trading Stocks | Medium | Arrays | Sorting / Prefix / Scan | 48.2% | 37.5% | all |
| 338 | Counting Bits | Easy | Core DSA | Implementation / Reasoning | 80.6% | 37.5% | all |
| 332 | Reconstruct Itinerary | Hard | Core DSA | Implementation / Reasoning | 44.6% | 37.5% | all |
| 2215 | Find the Difference of Two Arrays | Easy | Arrays | Sorting / Prefix / Scan | 81.4% | 37.5% | all |
| 67 | Add Binary | Easy | Core DSA | Implementation / Reasoning | 58.1% | 37.5% | all |
| 983 | Minimum Cost For Tickets | Medium | Arrays | Sorting / Prefix / Scan | 67.4% | 37.5% | all |
| 59 | Spiral Matrix II | Medium | Arrays | Sorting / Prefix / Scan | 75.1% | 37.5% | all |
| 341 | Flatten Nested List Iterator | Medium | Linked List; Design | Two Pointers; Data Structure Design | 65.7% | 37.5% | all |
| 1326 | Minimum Number of Taps to Open to Water a Garden | Hard | Arrays | Sorting / Prefix / Scan | 51.0% | 37.5% | all |