Yahoo coding interview
questions, leaked.
106 problems reported across recent Yahoo interviews. Top patterns: array, string, dynamic programming. The list below is what most candidates actually saw, plus the honest play if you can't grind all of it.
Yahoo's interview loop hits you with 106 problems across their online assessment, and 51 of them are array problems. You're walking in knowing two-pointers, hash tables, and dynamic programming will carry you through most of the medium-difficulty grind. But the gap between drilling Two Sum at home and blanking on Median of Two Sorted Arrays under a proctor's eye is real. StealthCoder sits invisibly during your assessment, reading the problem and surfacing a working solution in seconds if you hit a wall on the hard stuff or forget a pattern mid-solve.
Top problems at Yahoo
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Two Sum | EASY | 100.0 | 56% | Array · Hash Table |
| 02 | Longest Substring Without Repeating Characters | MEDIUM | 75.8 | 37% | Hash Table · String · Sliding Window |
| 03 | Container With Most Water | MEDIUM | 73.8 | 58% | Array · Two Pointers · Greedy |
| 04 | Roman to Integer | EASY | 72.7 | 65% | Hash Table · Math · String |
| 05 | Maximum Depth of Binary Tree | EASY | 71.5 | 77% | Tree · Depth-First Search · Breadth-First Search |
| 06 | Remove Duplicates from Sorted Array | EASY | 70.3 | 60% | Array · Two Pointers |
| 07 | 3Sum | MEDIUM | 70.3 | 37% | Array · Two Pointers · Sorting |
| 08 | Median of Two Sorted Arrays | HARD | 70.3 | 44% | Array · Binary Search · Divide and Conquer |
| 09 | Add Two Numbers | MEDIUM | 69.0 | 46% | Linked List · Math · Recursion |
| 10 | Merge Sorted Array | EASY | 69.0 | 53% | Array · Two Pointers · Sorting |
| 11 | Longest Palindromic Substring | MEDIUM | 67.7 | 36% | Two Pointers · String · Dynamic Programming |
| 12 | LRU Cache | MEDIUM | 67.7 | 45% | Hash Table · Linked List · Design |
| 13 | Best Time to Buy and Sell Stock | EASY | 64.6 | 55% | Array · Dynamic Programming |
| 14 | Rotate Image | MEDIUM | 64.6 | 78% | Array · Math · Matrix |
| 15 | Word Break | MEDIUM | 64.6 | 48% | Array · Hash Table · String |
| 16 | Merge Two Sorted Lists | EASY | 62.9 | 67% | Linked List · Recursion |
| 17 | Climbing Stairs | EASY | 62.9 | 54% | Math · Dynamic Programming · Memoization |
| 18 | Palindrome Number | EASY | 62.9 | 59% | Math |
| 19 | Valid Parentheses | EASY | 62.9 | 42% | String · Stack |
| 20 | Longest Common Prefix | EASY | 62.9 | 45% | String · Trie |
| 21 | Linked List Cycle | EASY | 62.9 | 53% | Hash Table · Linked List · Two Pointers |
| 22 | Generate Parentheses | MEDIUM | 61.1 | 77% | String · Dynamic Programming · Backtracking |
| 23 | Merge Intervals | MEDIUM | 61.1 | 49% | Array · Sorting |
| 24 | Jump Game | MEDIUM | 59.1 | 39% | Array · Dynamic Programming · Greedy |
| 25 | Spiral Matrix | MEDIUM | 56.9 | 54% | Array · Matrix · Simulation |
| 26 | Group Anagrams | MEDIUM | 54.4 | 71% | Array · Hash Table · String |
| 27 | Remove Element | EASY | 54.4 | 60% | Array · Two Pointers |
| 28 | Trapping Rain Water | HARD | 54.4 | 65% | Array · Two Pointers · Dynamic Programming |
| 29 | Search Insert Position | EASY | 54.4 | 49% | Array · Binary Search |
| 30 | Combination Sum | MEDIUM | 51.6 | 75% | Array · Backtracking |
| 31 | Find the Index of the First Occurrence in a String | EASY | 51.6 | 45% | Two Pointers · String · String Matching |
| 32 | Subsets | MEDIUM | 51.6 | 81% | Array · Backtracking · Bit Manipulation |
| 33 | Plus One | EASY | 51.6 | 48% | Array · Math |
| 34 | Reverse Integer | MEDIUM | 51.6 | 30% | Math |
| 35 | Count and Say | MEDIUM | 51.6 | 61% | String |
| 36 | Find First and Last Position of Element in Sorted Array | MEDIUM | 51.6 | 47% | Array · Binary Search |
| 37 | Set Matrix Zeroes | MEDIUM | 48.3 | 61% | Array · Hash Table · Matrix |
| 38 | Sqrt(x) | EASY | 48.3 | 40% | Math · Binary Search |
| 39 | Pascal's Triangle | EASY | 48.3 | 77% | Array · Dynamic Programming |
| 40 | Divide Two Integers | MEDIUM | 48.3 | 18% | Math · Bit Manipulation |
| 41 | Maximum Subarray | MEDIUM | 48.3 | 52% | Array · Divide and Conquer · Dynamic Programming |
| 42 | Letter Combinations of a Phone Number | MEDIUM | 48.3 | 64% | Hash Table · String · Backtracking |
| 43 | Largest Rectangle in Histogram | HARD | 44.5 | 47% | Array · Stack · Monotonic Stack |
| 44 | Pow(x, n) | MEDIUM | 44.5 | 37% | Math · Recursion |
| 45 | Valid Palindrome | EASY | 44.5 | 51% | Two Pointers · String |
| 46 | Next Permutation | MEDIUM | 44.5 | 43% | Array · Two Pointers |
| 47 | Binary Tree Level Order Traversal | MEDIUM | 44.5 | 71% | Tree · Breadth-First Search · Binary Tree |
| 48 | Zigzag Conversion | MEDIUM | 44.5 | 52% | String |
| 49 | Regular Expression Matching | HARD | 44.5 | 29% | String · Dynamic Programming · Recursion |
| 50 | Recover Binary Search Tree | MEDIUM | 39.9 | 56% | Tree · Depth-First Search · Binary Search Tree |
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 Yahoo OA. The proctor cannot see it. Screen share cannot detect it. Made by an Amazon engineer who watched the leaked-problem repo become an industry secret. He decided you should have it too.
Get StealthCoder- array51 · 48%
- string25 · 24%
- dynamic programming22 · 21%
- hash table19 · 18%
- two pointers19 · 18%
- linked list13 · 12%
- math13 · 12%
- stack11 · 10%
- tree11 · 10%
- sorting10 · 9%
The distribution screams arrays first, then strings and DP as your secondary anchors. Two-pointers appears in 19 problems and dominates Yahoo's medium tier (Container With Most Water, 3Sum, Longest Palindromic Substring). Hash tables show up in 19 problems but often pair with arrays or strings, so don't isolate them. The hard problems (12 total) skew toward binary search and divide-and-conquer (Median of Two Sorted Arrays is the canonical brick wall here). Linked lists and tree problems exist but lower volume. Drill arrays and two-pointers until they're automatic, then lock in hash-table string combos and DP backtracking. When you hit the assessment itself, StealthCoder is your insurance policy if you get stuck on Longest Palindromic Substring or any hard outlier you didn't see in your prep sprint.
Companies with similar patterns
If you prepped for Yahoo, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Yahoo.
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. Made by an Amazon engineer who watched the leaked-problem repo become an industry secret. He decided you should have it too. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Yahoo interview FAQ
How many array problems should I solve before Yahoo's assessment?+
Yahoo loaded 51 of 106 problems with arrays, so they're non-negotiable. Solve at least 15-20 across easy and medium (Two Sum, Container With Most Water, Remove Duplicates, Merge Sorted Array) until the patterns stick. Skip the deep DP variants initially; two-pointers and basic iteration cover most of them.
Is dynamic programming required for Yahoo?+
22 of 106 problems touch DP, but most are medium difficulty and often pair with arrays or strings. You don't need hard DP chops. Solve Best Time to Buy and Sell Stock, Word Break, and one or two palindrome variants. That covers 80 percent of what they ask.
What's the hardest gap between what I drill and what they ask?+
Median of Two Sorted Arrays is their only hard problem in the top list, and it requires binary search on two arrays simultaneously. Most candidates skip it in prep. Spend one focused session on it; if it clicks, great. If not on test day, you'll have StealthCoder as backup.
Should I study linked lists and trees for Yahoo?+
Linked lists appear in 13 problems, trees in 11. Lower volume than arrays and strings, but don't ignore them. LRU Cache (hash table plus linked list) is a design problem they favor. Solve Maximum Depth of Binary Tree and one linked-list reverse variant, then move on.
How much of Yahoo's assessment is easy versus medium?+
27 easy, 67 medium, 12 hard out of 106 total. That's 25 percent easy, 63 percent medium. You'll see a wall of medium problems, so don't waste time re-drilling easy problems the week before. Lock medium patterns (two-pointers, hash-table strings, light DP) and go in confident.