Adobe coding interview
questions, leaked.
113 problems reported across recent Adobe interviews. Top patterns: array, string, hash table. The list below is what most candidates actually saw, plus the honest play if you can't grind all of it.
Adobe's interview hits you with 113 problems across their OA, split 68 medium and 17 hard. Array problems dominate the list at 56 occurrences, followed by strings at 29. You're walking into a gauntlet where you can't memorize your way out. Two Sum, 3Sum, Longest Substring Without Repeating Characters, and Trapping Rain Water are the anchor problems that recur. If you blank mid-assessment on any pattern you didn't drill, StealthCoder runs invisible during screen share and surfaces a working solution in seconds, so you keep momentum and don't tank your score.
Top problems at Adobe
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Two Sum | EASY | 100.0 | 56% | Array · Hash Table |
| 02 | Longest Common Prefix | EASY | 79.0 | 45% | String · Trie |
| 03 | 3Sum | MEDIUM | 78.6 | 37% | Array · Two Pointers · Sorting |
| 04 | Median of Two Sorted Arrays | HARD | 77.0 | 44% | Array · Binary Search · Divide and Conquer |
| 05 | Longest Substring Without Repeating Characters | MEDIUM | 75.7 | 37% | Hash Table · String · Sliding Window |
| 06 | Reverse Integer | MEDIUM | 74.3 | 30% | Math |
| 07 | Trapping Rain Water | HARD | 72.2 | 65% | Array · Two Pointers · Dynamic Programming |
| 08 | Merge Sorted Array | EASY | 71.6 | 53% | Array · Two Pointers · Sorting |
| 09 | Add Two Numbers | MEDIUM | 70.5 | 46% | Linked List · Math · Recursion |
| 10 | Climbing Stairs | EASY | 69.9 | 54% | Math · Dynamic Programming · Memoization |
| 11 | Palindrome Number | EASY | 68.6 | 59% | Math |
| 12 | Group Anagrams | MEDIUM | 68.6 | 71% | Array · Hash Table · String |
| 13 | Valid Parentheses | EASY | 66.6 | 42% | String · Stack |
| 14 | Container With Most Water | MEDIUM | 64.3 | 58% | Array · Two Pointers · Greedy |
| 15 | Remove Duplicates from Sorted Array | EASY | 64.3 | 60% | Array · Two Pointers |
| 16 | Longest Palindromic Substring | MEDIUM | 64.3 | 36% | Two Pointers · String · Dynamic Programming |
| 17 | Next Permutation | MEDIUM | 63.4 | 43% | Array · Two Pointers |
| 18 | Remove Element | EASY | 63.4 | 60% | Array · Two Pointers |
| 19 | Spiral Matrix | MEDIUM | 62.6 | 54% | Array · Matrix · Simulation |
| 20 | Roman to Integer | EASY | 62.6 | 65% | Hash Table · Math · String |
| 21 | Merge Two Sorted Lists | EASY | 61.7 | 67% | Linked List · Recursion |
| 22 | Set Matrix Zeroes | MEDIUM | 59.7 | 61% | Array · Hash Table · Matrix |
| 23 | Jump Game | MEDIUM | 57.5 | 39% | Array · Dynamic Programming · Greedy |
| 24 | Plus One | EASY | 57.5 | 48% | Array · Math |
| 25 | Generate Parentheses | MEDIUM | 56.3 | 77% | String · Dynamic Programming · Backtracking |
| 26 | Letter Combinations of a Phone Number | MEDIUM | 55.1 | 64% | Hash Table · String · Backtracking |
| 27 | Rotate Image | MEDIUM | 55.1 | 78% | Array · Math · Matrix |
| 28 | Integer to Roman | MEDIUM | 53.7 | 69% | Hash Table · Math · String |
| 29 | Merge Intervals | MEDIUM | 52.3 | 49% | Array · Sorting |
| 30 | Find First and Last Position of Element in Sorted Array | MEDIUM | 52.3 | 47% | Array · Binary Search |
| 31 | Permutations | MEDIUM | 52.3 | 81% | Array · Backtracking |
| 32 | Remove Duplicates from Sorted Array II | MEDIUM | 50.7 | 63% | Array · Two Pointers |
| 33 | Sqrt(x) | EASY | 50.7 | 40% | Math · Binary Search |
| 34 | Jump Game II | MEDIUM | 50.7 | 42% | Array · Dynamic Programming · Greedy |
| 35 | Unique Paths | MEDIUM | 49.0 | 66% | Math · Dynamic Programming · Combinatorics |
| 36 | Combination Sum II | MEDIUM | 49.0 | 58% | Array · Backtracking |
| 37 | Sort Colors | MEDIUM | 49.0 | 68% | Array · Two Pointers · Sorting |
| 38 | Maximum Subarray | MEDIUM | 49.0 | 52% | Array · Divide and Conquer · Dynamic Programming |
| 39 | Valid Sudoku | MEDIUM | 49.0 | 62% | Array · Hash Table · Matrix |
| 40 | Merge k Sorted Lists | HARD | 49.0 | 57% | Linked List · Divide and Conquer · Heap (Priority Queue) |
| 41 | First Missing Positive | HARD | 49.0 | 41% | Array · Hash Table |
| 42 | Pow(x, n) | MEDIUM | 47.2 | 37% | Math · Recursion |
| 43 | Search in Rotated Sorted Array | MEDIUM | 47.2 | 43% | Array · Binary Search |
| 44 | Search Insert Position | EASY | 45.2 | 49% | Array · Binary Search |
| 45 | Construct Binary Tree from Preorder and Inorder Traversal | MEDIUM | 45.2 | 67% | Array · Hash Table · Divide and Conquer |
| 46 | Divide Two Integers | MEDIUM | 45.2 | 18% | Math · Bit Manipulation |
| 47 | Subsets | MEDIUM | 45.2 | 81% | Array · Backtracking · Bit Manipulation |
| 48 | Find the Index of the First Occurrence in a String | EASY | 45.2 | 45% | Two Pointers · String · String Matching |
| 49 | Minimum Window Substring | HARD | 42.9 | 45% | Hash Table · String · Sliding Window |
| 50 | Swap Nodes in Pairs | MEDIUM | 42.9 | 67% | Linked List · Recursion |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Adobe OA. The proctor cannot see it. Screen share cannot detect it. Built by an Amazon engineer who used it to pass JPMorgan's OA and system design loop.
Get StealthCoder- array56 · 50%
- string29 · 26%
- hash table21 · 19%
- dynamic programming18 · 16%
- two pointers17 · 15%
- math16 · 14%
- tree14 · 12%
- binary tree14 · 12%
- backtracking13 · 12%
- linked list12 · 11%
Array and string problems make up nearly 75 percent of Adobe's question pool. Two-pointers, hash-tables, and dynamic programming are the three patterns that unlock half the mediums and hards. Your first week should be Two Sum through 3Sum to solidify array and hash-table fluency, then move to Trapping Rain Water to lock in two-pointers and DP intuition. String problems like Longest Substring Without Repeating Characters test sliding window and hash-table together, so don't isolate them. The hard problems cluster around binary search and monotonic stacks. If you hit a wall on Trapping Rain Water or Median of Two Sorted Arrays during the live OA, StealthCoder is your safety net, invisible to the proctor, surfacing a correct approach so you don't spiral into the time trap.
Companies with similar patterns
If you prepped for Adobe, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Adobe.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by an Amazon engineer who used it to pass JPMorgan's OA and system design loop. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Adobe interview FAQ
How many array problems should I solve before the Adobe OA?+
Target 20 to 25. Arrays make up 56 of 113 problems. Start with Two Sum, Merge Sorted Array, and Remove Duplicates from Sorted Array, then push to 3Sum and Container With Most Water. Once two-pointers and hash-table patterns click, move to Trapping Rain Water to practice under harder constraints.
Is dynamic programming essential for Adobe?+
Yes, but conditional. DP appears in 18 problems. Climbing Stairs is your entry point, then graduate to Trapping Rain Water. Most mediums don't force pure DP; they stack it with two-pointers or arrays. You can skip advanced DP greedy hybrids if you're confident on arrays and two-pointers first.
What topic should I study first for Adobe?+
Arrays. 56 of 113 problems use arrays. Strings come second at 29. Hash-tables are the bridge that unlocks both. Spend 4 days on Two Sum, 3Sum, and basic array manipulation, then layer hash-table and string problems. Two-pointers unlock medium difficulty on arrays and should be your second pattern.
How many string problems do I need to drill?+
Aim for 12 to 15. Strings are 29 problems, but most are solved with hash-table or sliding-window patterns you'll learn on arrays first. Longest Substring Without Repeating Characters is the core. Valid Parentheses and Longest Common Prefix cover the easy tier quickly.
Should I worry about hard problems before the OA?+
No. Hards are only 17 of 113 problems. 68 are medium. Master Two Sum, 3Sum, Group Anagrams, and Longest Substring without Repeating Characters first. If you see Trapping Rain Water or Median of Two Sorted Arrays cold during the OA and freeze, you've got your hedge.