Yahoo Interview Questions — 100 DSA Problems
100 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.
Most frequently asked Yahoo LeetCode questions for software engineering interviews.
- Two Sum (EASY) — Array, Hash Table
- Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
- Container With Most Water (MEDIUM) — Array, Two Pointers, Greedy
- Roman to Integer (EASY) — Hash Table, Math, String
- Maximum Depth of Binary Tree (EASY) — Tree, Depth-First Search, Breadth-First Search, Binary Tree
- Median of Two Sorted Arrays (HARD) — Array, Binary Search, Divide and Conquer
- Remove Duplicates from Sorted Array (EASY) — Array, Two Pointers
- 3Sum (MEDIUM) — Array, Two Pointers, Sorting
- Add Two Numbers (MEDIUM) — Linked List, Math, Recursion
- Merge Sorted Array (EASY) — Array, Two Pointers, Sorting
- LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
- Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming
- Rotate Image (MEDIUM) — Array, Math, Matrix
- Word Break (MEDIUM) — Array, Hash Table, String, Dynamic Programming, Trie, Memoization
- Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
- Merge Two Sorted Lists (EASY) — Linked List, Recursion
- Valid Parentheses (EASY) — String, Stack
- Linked List Cycle (EASY) — Hash Table, Linked List, Two Pointers
- Climbing Stairs (EASY) — Math, Dynamic Programming, Memoization
- Longest Common Prefix (EASY) — String, Trie
- Palindrome Number (EASY) — Math
- Merge Intervals (MEDIUM) — Array, Sorting
- Generate Parentheses (MEDIUM) — String, Dynamic Programming, Backtracking
- Jump Game (MEDIUM) — Array, Dynamic Programming, Greedy
- Spiral Matrix (MEDIUM) — Array, Matrix, Simulation
- Group Anagrams (MEDIUM) — Array, Hash Table, String, Sorting
- Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
- Search Insert Position (EASY) — Array, Binary Search
- Remove Element (EASY) — Array, Two Pointers
- Combination Sum (MEDIUM) — Array, Backtracking
- Plus One (EASY) — Array, Math
- Find the Index of the First Occurrence in a String (EASY) — Two Pointers, String, String Matching
- Count and Say (MEDIUM) — String
- Reverse Integer (MEDIUM) — Math
- Find First and Last Position of Element in Sorted Array (MEDIUM) — Array, Binary Search
- Subsets (MEDIUM) — Array, Backtracking, Bit Manipulation
- Sqrt(x) (EASY) — Math, Binary Search
- Set Matrix Zeroes (MEDIUM) — Array, Hash Table, Matrix
- Letter Combinations of a Phone Number (MEDIUM) — Hash Table, String, Backtracking
- Divide Two Integers (MEDIUM) — Math, Bit Manipulation
- Pascal's Triangle (EASY) — Array, Dynamic Programming
- Maximum Subarray (MEDIUM) — Array, Divide and Conquer, Dynamic Programming
- Binary Tree Level Order Traversal (MEDIUM) — Tree, Breadth-First Search, Binary Tree
- Zigzag Conversion (MEDIUM) — String
- Next Permutation (MEDIUM) — Array, Two Pointers
- Regular Expression Matching (HARD) — String, Dynamic Programming, Recursion
- Pow(x, n) (MEDIUM) — Math, Recursion
- Valid Palindrome (EASY) — Two Pointers, String
- Largest Rectangle in Histogram (HARD) — Array, Stack, Monotonic Stack
- Gas Station (MEDIUM) — Array, Greedy
Y
Yahoo
100 questions tracked100 with solutions
Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough
Showing 100 of 100 questions
2Hash TableStringSliding Window
5TreeDepth-First SearchBreadth-First SearchBinary Tree
6ArrayBinary SearchDivide and Conquer
11Hash TableLinked ListDesignDoubly-Linked List
12Two PointersStringDynamic Programming
14ArrayHash TableStringDynamic Programming+2
18Hash TableLinked ListTwo Pointers
19MathDynamic ProgrammingMemoization
23StringDynamic ProgrammingBacktracking
24ArrayDynamic ProgrammingGreedy
26ArrayHash TableStringSorting
27ArrayTwo PointersDynamic ProgrammingStack+1
32Two PointersStringString Matching
35MediumFind First and Last Position of Element in Sorted Array✓ Our Solution ArrayBinary Search
36ArrayBacktrackingBit Manipulation
39Hash TableStringBacktracking
42ArrayDivide and ConquerDynamic Programming
43TreeBreadth-First SearchBinary Tree
46StringDynamic ProgrammingRecursion
49ArrayStackMonotonic Stack
56ArrayHash TableUnion Find
58TreeDepth-First SearchBinary Search TreeBinary Tree
59TreeDepth-First SearchBinary Search TreeBinary Tree
62TreeDepth-First SearchBreadth-First SearchBinary Tree
63ArrayDynamic ProgrammingGreedy
64StackTreeDepth-First SearchBinary Tree
65MathDynamic ProgrammingCombinatorics
72ArrayHash TableBacktrackingMatrix
75StringDynamic ProgrammingBacktracking
76Hash TableDepth-First SearchBreadth-First SearchGraph
77StringDynamic ProgrammingStack
78Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
81Linked ListTwo PointersStackRecursion
82Linked ListTwo PointersDivide and ConquerSorting+1
83Hash TableStringBreadth-First Search
85ArrayDynamic ProgrammingStackMatrix+1
89Linked ListStackTreeDepth-First Search+1
90MediumConstruct Binary Tree from Preorder and Inorder Traversal✓ Our Solution ArrayHash TableDivide and ConquerTree+1
91ArrayDynamic ProgrammingMatrix
92ArrayDynamic ProgrammingMatrix
94TreeDepth-First SearchBreadth-First SearchBinary Tree
95StringDynamic Programming
96Hash TableStringSliding Window
97StringDynamic Programming
98MathDynamic ProgrammingTreeBinary Search Tree+1