Yahoo interview questions¶
The most frequent LeetCode problems tagged to Yahoo. This is a data-only page. For process and behavioral prep, use the coding guide and behavioral guide.
Based on 0 distinct problems tagged to Yahoo in the last 6 months (0 in the last 30 days, 0 in the last 3 months, 33 all-time) across two open datasets of LeetCode company tags. Tags are user-reported, so treat frequency as a signal, not a promise.
Most frequent problems¶
Ranked by frequency, weighted toward the last 30 days. Classics like Two Sum sit near the top of almost every company's list because users tag them everywhere. Solve those fast. The signature list below is more specific to this company.
| # | Problem | Difficulty | Last seen | Topics |
|---|---|---|---|---|
| 1 | Binary Number with Alternating Bits | Easy | Older | Bit Manipulation |
| 2 | Contains Duplicate | Easy | Older | Array, Hash Table, Sorting |
| 3 | LRU Cache | Medium | Older | Hash Table, Linked List, Design, Doubly-Linked List |
| 4 | Largest Palindrome Product | Hard | Older | Math, Enumeration |
| 5 | Linked List Cycle | Easy | Older | Hash Table, Linked List, Two Pointers, Floyd's Cycle Finding Algorithm |
| 6 | Matrix Cells in Distance Order | Easy | Older | Array, Math, Geometry, Sorting |
| 7 | Maximum Depth of Binary Tree | Easy | Older | Tree, Depth-First Search, Breadth-First Search, Binary Tree |
| 8 | Maximum Distance in Arrays | Medium | Older | Array, Greedy |
| 9 | Median of Two Sorted Arrays | Hard | Older | Array, Binary Search, Divide and Conquer |
| 10 | Non-decreasing Subsequences | Medium | Older | Array, Hash Table, Backtracking, Bit Manipulation |
| 11 | Peeking Iterator | Medium | Older | Array, Design, Iterator |
| 12 | Reverse Linked List | Easy | Older | Linked List, Recursion |
| 13 | Roman to Integer | Easy | Older | Hash Table, Math, String |
| 14 | Serialize and Deserialize Binary Tree | Hard | Older | String, Tree, Depth-First Search, Breadth-First Search |
| 15 | Two Sum | Easy | Older | Array, Hash Table |
| 16 | Word Break | Medium | Older | Array, Hash Table, String, Dynamic Programming |
| 17 | Top K Frequent Elements | Medium | Older | Array, Hash Table, Divide and Conquer, Sorting |
| 18 | Combination Sum | Medium | Older | Array, Backtracking |
| 19 | Decode String | Medium | Older | String, Stack, Recursion |
| 20 | Evaluate Division | Medium | Older | Array, String, Depth-First Search, Breadth-First Search |
| 21 | Find Peak Element | Medium | Older | Array, Binary Search |
| 22 | Flatten Nested List Iterator | Medium | Older | Stack, Tree, Depth-First Search, Design |
| 23 | Longest Common Prefix | Easy | Older | Array, String, Trie |
| 24 | Meeting Rooms II | Medium | Older | Array, Two Pointers, Greedy, Sorting |
| 25 | Restore IP Addresses | Medium | Older | String, Backtracking |
| 26 | Search in Rotated Sorted Array | Medium | Older | Array, Binary Search |
| 27 | Shortest Path in Binary Matrix | Medium | Older | Array, Breadth-First Search, Matrix |
| 28 | Spiral Matrix | Medium | Older | Array, Matrix, Simulation |
| 29 | Subarray Sum Equals K | Medium | Older | Array, Hash Table, Prefix Sum |
| 30 | Valid Parentheses | Easy | Older | String, Stack, Bracket Sequences |
| 31 | Validate Binary Search Tree | Medium | Older | Tree, Depth-First Search, Binary Search Tree, Binary Tree |
| 32 | Word Search | Medium | Older | Array, String, Backtracking, Depth-First Search |
| 33 | Palindrome Number | Easy | Older | Math |
Sources¶
- liquidslr/leetcode-company-wise-problems and snehasishroy/leetcode-companywise-interview-questions, merged by scripts/build_question_data.py.
Next: More companies