35 curated coding interview questions directly asked in Yahoo technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 253 | Meeting Rooms II | Medium | Greedy | Greedy | 52.7% | 100.0% | 6m |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 100.0% | all |
| 4 | Median of Two Sorted Arrays | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 46.6% | 100.0% | all |
| 13 | Roman to Integer | Easy | Strings | Hashing / Sliding Window | 66.6% | 100.0% | all |
| 104 | Maximum Depth of Binary Tree | Easy | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 78.2% | 100.0% | all |
| 139 | Word Break | Medium | Strings; Dynamic Programming | Hashing / Sliding Window; State Transition | 49.5% | 100.0% | all |
| 141 | Linked List Cycle | Easy | Linked List | Two Pointers | 54.3% | 100.0% | all |
| 146 | LRU Cache | Medium | Design | Data Structure Design | 47.4% | 100.0% | all |
| 206 | Reverse Linked List | Easy | Linked List | Two Pointers | 80.6% | 100.0% | all |
| 217 | Contains Duplicate | Easy | Arrays | Sorting / Prefix / Scan | 64.4% | 100.0% | all |
| 284 | Peeking Iterator | Medium | Design | Data Structure Design | 61.5% | 100.0% | all |
| 297 | Serialize and Deserialize Binary Tree | Hard | Trees; Design | DFS / BFS; Data Structure Design | 60.8% | 100.0% | all |
| 479 | Largest Palindrome Product | Hard | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 38.9% | 100.0% | all |
| 491 | Non-decreasing Subsequences | Medium | Core DSA | Implementation / Reasoning | 62.7% | 100.0% | all |
| 624 | Maximum Distance in Arrays | Medium | Arrays | Sorting / Prefix / Scan | 45.6% | 100.0% | all |
| 693 | Binary Number with Alternating Bits | Easy | Core DSA | Implementation / Reasoning | 69.9% | 100.0% | all |
| 1030 | Matrix Cells in Distance Order | Easy | Arrays | Sorting / Prefix / Scan | 74.2% | 100.0% | all |
| 347 | Top K Frequent Elements | Medium | Heap | Priority Queue | 66.4% | 75.0% | all |
| 14 | Longest Common Prefix | Easy | Core DSA | Implementation / Reasoning | 47.6% | 62.5% | all |
| 39 | Combination Sum | Medium | Arrays; Backtracking | Sorting / Prefix / Scan; Backtracking | 76.5% | 62.5% | all |
| 394 | Decode String | Medium | Strings; Dynamic Programming; Stack / Queue | Hashing / Sliding Window; State Transition; Monotonic Stack / Simulation | 62.6% | 62.5% | all |
| 9 | Palindrome Number | Easy | Strings | Hashing / Sliding Window | 60.6% | 50.0% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 50.0% | all |
| 33 | Search in Rotated Sorted Array | Medium | Arrays; Binary Search | Sorting / Prefix / Scan; Binary Search | 44.9% | 50.0% | all |
| 54 | Spiral Matrix | Medium | Arrays | Sorting / Prefix / Scan | 56.8% | 50.0% | all |
| 98 | Validate Binary Search Tree | Medium | Strings; Trees; Binary Search | Hashing / Sliding Window; DFS / BFS; Binary Search | 35.8% | 50.0% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 50.0% | all |
| 424 | Longest Repeating Character Replacement | Medium | Strings | Hashing / Sliding Window | 59.7% | 50.0% | all |
| 560 | Subarray Sum Equals K | Medium | Arrays | Sorting / Prefix / Scan | 47.3% | 50.0% | all |
| 1091 | Shortest Path in Binary Matrix | Medium | Arrays | Sorting / Prefix / Scan | 51.5% | 50.0% | all |
| 93 | Restore IP Addresses | Medium | Core DSA | Implementation / Reasoning | 56.0% | 50.0% | all |
| 399 | Evaluate Division | Medium | Core DSA | Implementation / Reasoning | 64.2% | 50.0% | all |
| 341 | Flatten Nested List Iterator | Medium | Linked List; Design | Two Pointers; Data Structure Design | 65.7% | 50.0% | all |
| 162 | Find Peak Element | Medium | Binary Search | Binary Search | 47.0% | 50.0% | all |
| 79 | Word Search | Medium | Strings; Binary Search | Hashing / Sliding Window; Binary Search | 47.4% | 50.0% | all |