How often are these problems asked?
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Yahoo interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Problem database last updated: June 20, 2025
100 problems · 25 Easy, 63 Medium, 12 Hard · Ranked #10 of 458
25 Easy
25% · avg 23%
63 Medium
63% · avg 59%
12 Hard
12% · avg 18%
Based on 100 reported problems, Yahoo interviews are in line with industry averages - 12% Hard vs 18% overall. The majority (63%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Yahoo puts unusual emphasis on binary-search-tree (3% of problems, 2.7x the industry average), merge-sort (2% of problems, 2.7x the industry average), binary-tree (10% of problems, 2x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (50%), string (24%), dynamic-programming (22%), two-pointers (19%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Two Sum Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target. | Easy | Very Likely | arrayhash-map | Solve |
Longest Substring Without Repeating Characters Given a string s, find the length of the longest substring without duplicate characters. | Medium | Very Likely | hash-tablestringsliding-window | Solve |
Container With Most Water You are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). | Medium | Likely | arraytwo-pointersgreedy | Solve |
Roman to Integer Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. | Easy | Likely | hash-tablemathstring | Solve |
Maximum Depth of Binary Tree Given the root of a binary tree, return its maximum depth. | Easy | Likely | treedepth-first-searchbreadth-first-search | Solve |
3Sum Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. | Medium | Likely | arraytwo-pointerssorting | Solve |
Median of Two Sorted Arrays Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. | Hard | Likely | arraybinary-searchdivide-and-conquer | Solve |
Remove Duplicates from Sorted Array Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order o... | Easy | Likely | arraytwo-pointers | Solve |
Add Two Numbers You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a sing... | Medium | Likely | linked-listmathrecursion | Solve |
Merge Sorted Array You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and num... | Easy | Likely | arraytwo-pointerssorting | Solve |
LRU Cache Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. | Medium | Likely | hash-tablelinked-listdesign | Solve |
Longest Palindromic Substring Given a string s, return the longest palindromic substring in s. | Medium | Likely | two-pointersstringdynamic-programming | Solve |
Word Break Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words. | Medium | Likely | arrayhash-tablestring | Solve |
Best Time to Buy and Sell Stock You are given an array prices where prices[i] is the price of a given stock on the ith day. | Easy | Likely | arraydynamic-programming | Solve |
Rotate Image You are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise). | Medium | Likely | arraymathmatrix | Solve |
Valid Parentheses Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. | Easy | Likely | stringstack | Solve |
Linked List Cycle Given head, the head of a linked list, determine if the linked list has a cycle in it. | Easy | Likely | hash-tablelinked-listtwo-pointers | Solve |
Climbing Stairs You are climbing a staircase. It takes n steps to reach the top. | Easy | Likely | mathdynamic-programmingmemoization | Solve |
Palindrome Number Given an integer x, return true if x is a palindrome, and false otherwise. | Easy | Likely | math | Solve |
Merge Two Sorted Lists You are given the heads of two sorted linked lists list1 and list2. | Easy | Likely | linked-listrecursion | Solve |
Longest Common Prefix Write a function to find the longest common prefix string amongst an array of strings. | Easy | Likely | arraystringtrie | Solve |
Generate Parentheses Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. | Medium | Likely | stringdynamic-programmingbacktracking | Solve |
Merge Intervals Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove... | Medium | Likely | arraysorting | Solve |
Jump Game You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length... | Medium | Likely | arraydynamic-programminggreedy | Solve |
Spiral Matrix Given an m x n matrix, return all elements of the matrix in spiral order. | Medium | Likely | arraymatrixsimulation | Solve |
Trapping Rain Water Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining. | Hard | Likely | arraytwo-pointersdynamic-programming | Solve |
Remove Element Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The order of the elements may be changed. Then return the number... | Easy | Likely | arraytwo-pointers | Solve |
Search Insert Position Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were ins... | Easy | Likely | arraybinary-search | Solve |
Group Anagrams Given an array of strings strs, group the anagrams together. You can return the answer in any order. | Medium | Likely | arrayhash-tablestring | Solve |
Combination Sum Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum... | Medium | Likely | arraybacktracking | Solve |
Count and Say The count-and-say sequence is a sequence of digit strings defined by the recursive formula: | Medium | Likely | string | Solve |
Reverse Integer Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range [-231, 231 - 1... | Medium | Likely | math | Solve |
Plus One You are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most sig... | Easy | Likely | arraymath | Solve |
Find First and Last Position of Element in Sorted Array Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value. | Medium | Likely | arraybinary-search | Solve |
Find the Index of the First Occurrence in a String Given two strings needle and haystack, return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack. | Easy | Likely | two-pointersstringstring-matching | Solve |
Subsets Given an integer array nums of unique elements, return all possible subsets (the power set). | Medium | Likely | arraybacktrackingbit-manipulation | Solve |
Letter Combinations of a Phone Number Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order. | Medium | Sometimes | hash-tablestringbacktracking | Solve |
Divide Two Integers Given two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator. | Medium | Sometimes | mathbit-manipulation | Solve |
Maximum Subarray Given an integer array nums, find the subarray with the largest sum, and return its sum. | Medium | Sometimes | arraydivide-and-conquerdynamic-programming | Solve |
Set Matrix Zeroes Given an m x n integer matrix matrix, if an element is 0, set its entire row and column to 0's. | Medium | Sometimes | arrayhash-tablematrix | Solve |
Sqrt(x) Given a non-negative integer x, return the square root of x rounded down to the nearest integer. The returned integer should be non-negative as well. | Easy | Sometimes | mathbinary-search | Solve |
Pascal's Triangle Given an integer numRows, return the first numRows of Pascal's triangle. | Easy | Sometimes | arraydynamic-programming | Solve |
Pow(x, n) Implement pow(x, n), which calculates x raised to the power n (i.e., xn). | Medium | Sometimes | mathrecursion | Solve |
Valid Palindrome A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forwa... | Easy | Sometimes | two-pointersstring | Solve |
Next Permutation A permutation of an array of integers is an arrangement of its members into a sequence or linear order. | Medium | Sometimes | arraytwo-pointers | Solve |
Binary Tree Level Order Traversal Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level). | Medium | Sometimes | treebreadth-first-searchbinary-tree | Solve |
Regular Expression Matching Given an input string s and a pattern p, implement regular expression matching with support for '.' and '' where: | Hard | Sometimes | stringdynamic-programmingrecursion | Solve |
Largest Rectangle in Histogram Given an array of integers heights representing the histogram's bar height where the width of each bar is 1, return the area of the largest rectangle in the his... | Hard | Sometimes | arraystackmonotonic-stack | Solve |
Zigzag Conversion The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better... | Medium | Sometimes | string | Solve |
Validate Binary Search Tree Given the root of a binary tree, determine if it is a valid binary search tree (BST). | Medium | Sometimes | treedepth-first-searchbinary-search-tree | Solve |
Single Number Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. | Easy | Sometimes | arraybit-manipulation | Solve |
Search a 2D Matrix You are given an m x n integer matrix matrix with the following two properties: | Medium | Sometimes | arraybinary-searchmatrix | Solve |
Recover Binary Search Tree You are given the root of a binary search tree (BST), where the values of exactly two nodes of the tree were swapped by mistake. Recover the tree without changi... | Medium | Sometimes | treedepth-first-searchbinary-search-tree | Solve |
Longest Consecutive Sequence Given an unsorted array of integers nums, return the length of the longest consecutive elements sequence. | Medium | Sometimes | arrayhash-tableunion-find | Solve |
Search in Rotated Sorted Array There is an integer array nums sorted in ascending order (with distinct values). | Medium | Sometimes | arraybinary-search | Solve |
Length of Last Word Given a string s consisting of words and spaces, return the length of the last word in the string. | Easy | Sometimes | string | Solve |
Gas Station There are n gas stations along a circular route, where the amount of gas at the ith station is gas[i]. | Medium | Sometimes | arraygreedy | Solve |
3Sum Closest Given an integer array nums of length n and an integer target, find three integers at distinct indices in nums such that the sum is closest to target. | Medium | Sometimes | arraytwo-pointerssorting | Solve |
Permutations Given an array nums of distinct integers, return all the possible permutations. You can return the answer in any order. | Medium | Sometimes | arraybacktracking | Solve |
Sort Colors Given an array nums with n objects colored red, white, or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order... | Medium | Sometimes | arraytwo-pointerssorting | Solve |
Binary Tree Preorder Traversal Given the root of a binary tree, return the preorder traversal of its nodes' values. | Easy | Sometimes | stacktreedepth-first-search | Solve |
Unique Paths There is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner... | Medium | Sometimes | mathdynamic-programmingcombinatorics | Solve |
Integer to Roman Seven different symbols represent Roman numerals with the following values: | Medium | Sometimes | hash-tablemathstring | Solve |
Remove Duplicates from Sorted Array II Given an integer array nums sorted in non-decreasing order, remove some duplicates in-place such that each unique element appears at most twice. The relative or... | Medium | Sometimes | arraytwo-pointers | Solve |
Valid Sudoku Determine if a 9 x 9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules: | Medium | Sometimes | arrayhash-tablematrix | Solve |
String to Integer (atoi) Implement the myAtoi(string s) function, which converts a string to a 32-bit signed integer. | Medium | Sometimes | string | Solve |
4Sum Given an array nums of n integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that: | Medium | Sometimes | arraytwo-pointerssorting | Solve |
Remove Nth Node From End of List Given the head of a linked list, remove the nth node from the end of the list and return its head. | Medium | Sometimes | linked-listtwo-pointers | Solve |
Symmetric Tree Given the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center). | Easy | Sometimes | treedepth-first-searchbreadth-first-search | Solve |
Sudoku Solver Write a program to solve a Sudoku puzzle by filling the empty cells. | Hard | Sometimes | arrayhash-tablebacktracking | Solve |
Best Time to Buy and Sell Stock II You are given an integer array prices where prices[i] is the price of a given stock on the ith day. | Medium | Sometimes | arraydynamic-programminggreedy | Solve |
Maximum Product Subarray Given an integer array nums, find a subarray that has the largest product, and return the product. | Medium | Sometimes | arraydynamic-programming | Solve |
N-Queens The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other. | Hard | Sometimes | arraybacktracking | Solve |
Simplify Path You are given an absolute path for a Unix-style file system, which always begins with a slash '/'. Your task is to transform this absolute path into its simplif... | Medium | Sometimes | stringstack | Solve |
Same Tree Given the roots of two binary trees p and q, write a function to check if they are the same or not. | Easy | Sometimes | treedepth-first-searchbreadth-first-search | Solve |
Unique Paths II You are given an m x n integer array grid. There is a robot initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-r... | Medium | Sometimes | arraydynamic-programmingmatrix | Solve |
Unique Binary Search Trees Given an integer n, return the number of structurally unique BST's (binary search trees) which has exactly n nodes of unique values from 1 to n. | Medium | Sometimes | mathdynamic-programmingtree | Solve |
Maximal Rectangle Given a rows x cols binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area. | Hard | Sometimes | arraydynamic-programmingstack | Solve |
Palindrome Partitioning Given a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s. | Medium | Sometimes | stringdynamic-programmingbacktracking | Solve |
Insert Interval You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith interval and interv... | Medium | Sometimes | array | Solve |
Longest Valid Parentheses Given a string containing just the characters '(' and ')', return the length of the longest valid (well-formed) parentheses substring. | Hard | Sometimes | stringdynamic-programmingstack | Solve |
Minimum Path Sum Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path. | Medium | Sometimes | arraydynamic-programmingmatrix | Solve |
Minimum Window Substring Given two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is inc... | Hard | Sometimes | hash-tablestringsliding-window | Solve |
Interleaving String Given strings s1, s2, and s3, find whether s3 is formed by an interleaving of s1 and s2. | Medium | Sometimes | stringdynamic-programming | Solve |
Flatten Binary Tree to Linked List Given the root of a binary tree, flatten the tree into a "linked list": | Medium | Sometimes | linked-liststacktree | Solve |
Reverse Linked List II Given the head of a singly linked list and two integers left and right where left <= right, reverse the nodes of the list from position left to position right,... | Medium | Sometimes | linked-list | Solve |
Reverse Nodes in k-Group Given the head of a linked list, reverse the nodes of the list k at a time, and return the modified list. | Hard | Sometimes | linked-listrecursion | Solve |
Edit Distance Given two strings word1 and word2, return the minimum number of operations required to convert word1 to word2. | Medium | Sometimes | stringdynamic-programming | Solve |
Reorder List You are given the head of a singly linked-list. The list can be represented as: | Medium | Sometimes | linked-listtwo-pointersstack | Solve |
Merge k Sorted Lists You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. | Hard | Sometimes | linked-listdivide-and-conquerheap-priority-queue | Solve |
Construct Binary Tree from Preorder and Inorder Traversal Given two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of the same tree, c... | Medium | Sometimes | arrayhash-tabledivide-and-conquer | Solve |
Single Number II Given an integer array nums where every element appears three times except for one, which appears exactly once. Find the single element and return it. | Medium | Sometimes | arraybit-manipulation | Solve |
Word Ladder A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 -> s2 -> ... -> sk such that: | Hard | Sometimes | hash-tablestringbreadth-first-search | Solve |
Sort List Given the head of a linked list, return the list after sorting it in ascending order. | Medium | Sometimes | linked-listtwo-pointersdivide-and-conquer | Solve |
Find Minimum in Rotated Sorted Array Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become: | Medium | Sometimes | arraybinary-search | Solve |
Copy List with Random Pointer A linked list of length n is given such that each node contains an additional random pointer, which could point to any node in the list, or null. | Medium | Sometimes | hash-tablelinked-list | Solve |
Clone Graph Given a reference of a node in a connected undirected graph. | Medium | Sometimes | hash-tabledepth-first-searchbreadth-first-search | Solve |
Pascal's Triangle II Given an integer rowIndex, return the rowIndexth (0-indexed) row of the Pascal's triangle. | Easy | Sometimes | arraydynamic-programming | Solve |
Rotate List Given the head of a linked list, rotate the list to the right by k places. | Medium | Sometimes | linked-listtwo-pointers | Solve |
Search in Rotated Sorted Array II There is an integer array nums sorted in non-decreasing order (not necessarily with distinct values). | Medium | Sometimes | arraybinary-search | Solve |
Two Sum
SolveGiven an array of integers nums and an integer target, return the indices of the two numbers that add up to target.
Longest Substring Without Repeating Characters
SolveGiven a string s, find the length of the longest substring without duplicate characters.
Container With Most Water
SolveYou are given an integer array height of length n. There are n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]).
Roman to Integer
SolveRoman numerals are represented by seven different symbols: I, V, X, L, C, D and M.
Maximum Depth of Binary Tree
SolveGiven the root of a binary tree, return its maximum depth.
3Sum
SolveGiven an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
Median of Two Sorted Arrays
SolveGiven two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays.
Remove Duplicates from Sorted Array
SolveGiven an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order o...
Add Two Numbers
SolveYou are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a sing...
Merge Sorted Array
SolveYou are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and num...
LRU Cache
SolveDesign a data structure that follows the constraints of a Least Recently Used (LRU) cache.
Longest Palindromic Substring
SolveGiven a string s, return the longest palindromic substring in s.
Word Break
SolveGiven a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words.
Best Time to Buy and Sell Stock
SolveYou are given an array prices where prices[i] is the price of a given stock on the ith day.
Rotate Image
SolveYou are given an n x n 2D matrix representing an image, rotate the image by 90 degrees (clockwise).
Valid Parentheses
SolveGiven a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
Linked List Cycle
SolveGiven head, the head of a linked list, determine if the linked list has a cycle in it.
Climbing Stairs
SolveYou are climbing a staircase. It takes n steps to reach the top.
Palindrome Number
SolveGiven an integer x, return true if x is a palindrome, and false otherwise.
Merge Two Sorted Lists
SolveYou are given the heads of two sorted linked lists list1 and list2.
Longest Common Prefix
SolveWrite a function to find the longest common prefix string amongst an array of strings.
Generate Parentheses
SolveGiven n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
Merge Intervals
SolveGiven an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove...
Jump Game
SolveYou are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length...
Spiral Matrix
SolveGiven an m x n matrix, return all elements of the matrix in spiral order.
Trapping Rain Water
SolveGiven n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.
Remove Element
SolveGiven an integer array nums and an integer val, remove all occurrences of val in nums in-place. The order of the elements may be changed. Then return the number...
Search Insert Position
SolveGiven a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were ins...
Group Anagrams
SolveGiven an array of strings strs, group the anagrams together. You can return the answer in any order.
Combination Sum
SolveGiven an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum...
Count and Say
SolveThe count-and-say sequence is a sequence of digit strings defined by the recursive formula:
Reverse Integer
SolveGiven a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range [-231, 231 - 1...
Plus One
SolveYou are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most sig...
Find First and Last Position of Element in Sorted Array
SolveGiven an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value.
Find the Index of the First Occurrence in a String
SolveGiven two strings needle and haystack, return the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.
Subsets
SolveGiven an integer array nums of unique elements, return all possible subsets (the power set).
Letter Combinations of a Phone Number
SolveGiven a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order.
Divide Two Integers
SolveGiven two integers dividend and divisor, divide two integers without using multiplication, division, and mod operator.
Maximum Subarray
SolveGiven an integer array nums, find the subarray with the largest sum, and return its sum.
Set Matrix Zeroes
SolveGiven an m x n integer matrix matrix, if an element is 0, set its entire row and column to 0's.
Sqrt(x)
SolveGiven a non-negative integer x, return the square root of x rounded down to the nearest integer. The returned integer should be non-negative as well.
Pascal's Triangle
SolveGiven an integer numRows, return the first numRows of Pascal's triangle.
Pow(x, n)
SolveImplement pow(x, n), which calculates x raised to the power n (i.e., xn).
Valid Palindrome
SolveA phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forwa...
Next Permutation
SolveA permutation of an array of integers is an arrangement of its members into a sequence or linear order.
Binary Tree Level Order Traversal
SolveGiven the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level).
Regular Expression Matching
SolveGiven an input string s and a pattern p, implement regular expression matching with support for '.' and '' where:
Largest Rectangle in Histogram
SolveGiven an array of integers heights representing the histogram's bar height where the width of each bar is 1, return the area of the largest rectangle in the his...
Zigzag Conversion
SolveThe string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better...
Validate Binary Search Tree
SolveGiven the root of a binary tree, determine if it is a valid binary search tree (BST).
Single Number
SolveGiven a non-empty array of integers nums, every element appears twice except for one. Find that single one.
Search a 2D Matrix
SolveYou are given an m x n integer matrix matrix with the following two properties:
Recover Binary Search Tree
SolveYou are given the root of a binary search tree (BST), where the values of exactly two nodes of the tree were swapped by mistake. Recover the tree without changi...
Longest Consecutive Sequence
SolveGiven an unsorted array of integers nums, return the length of the longest consecutive elements sequence.
Search in Rotated Sorted Array
SolveThere is an integer array nums sorted in ascending order (with distinct values).
Length of Last Word
SolveGiven a string s consisting of words and spaces, return the length of the last word in the string.
Gas Station
SolveThere are n gas stations along a circular route, where the amount of gas at the ith station is gas[i].
3Sum Closest
SolveGiven an integer array nums of length n and an integer target, find three integers at distinct indices in nums such that the sum is closest to target.
Permutations
SolveGiven an array nums of distinct integers, return all the possible permutations. You can return the answer in any order.
Sort Colors
SolveGiven an array nums with n objects colored red, white, or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order...
Binary Tree Preorder Traversal
SolveGiven the root of a binary tree, return the preorder traversal of its nodes' values.
Unique Paths
SolveThere is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-right corner...
Integer to Roman
SolveSeven different symbols represent Roman numerals with the following values:
Remove Duplicates from Sorted Array II
SolveGiven an integer array nums sorted in non-decreasing order, remove some duplicates in-place such that each unique element appears at most twice. The relative or...
Valid Sudoku
SolveDetermine if a 9 x 9 Sudoku board is valid. Only the filled cells need to be validated according to the following rules:
String to Integer (atoi)
SolveImplement the myAtoi(string s) function, which converts a string to a 32-bit signed integer.
4Sum
SolveGiven an array nums of n integers, return an array of all the unique quadruplets [nums[a], nums[b], nums[c], nums[d]] such that:
Remove Nth Node From End of List
SolveGiven the head of a linked list, remove the nth node from the end of the list and return its head.
Symmetric Tree
SolveGiven the root of a binary tree, check whether it is a mirror of itself (i.e., symmetric around its center).
Sudoku Solver
SolveWrite a program to solve a Sudoku puzzle by filling the empty cells.
Best Time to Buy and Sell Stock II
SolveYou are given an integer array prices where prices[i] is the price of a given stock on the ith day.
Maximum Product Subarray
SolveGiven an integer array nums, find a subarray that has the largest product, and return the product.
N-Queens
SolveThe n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens attack each other.
Simplify Path
SolveYou are given an absolute path for a Unix-style file system, which always begins with a slash '/'. Your task is to transform this absolute path into its simplif...
Same Tree
SolveGiven the roots of two binary trees p and q, write a function to check if they are the same or not.
Unique Paths II
SolveYou are given an m x n integer array grid. There is a robot initially located at the top-left corner (i.e., grid[0][0]). The robot tries to move to the bottom-r...
Unique Binary Search Trees
SolveGiven an integer n, return the number of structurally unique BST's (binary search trees) which has exactly n nodes of unique values from 1 to n.
Maximal Rectangle
SolveGiven a rows x cols binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's and return its area.
Palindrome Partitioning
SolveGiven a string s, partition s such that every substring of the partition is a palindrome. Return all possible palindrome partitioning of s.
Insert Interval
SolveYou are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represent the start and the end of the ith interval and interv...
Longest Valid Parentheses
SolveGiven a string containing just the characters '(' and ')', return the length of the longest valid (well-formed) parentheses substring.
Minimum Path Sum
SolveGiven a m x n grid filled with non-negative numbers, find a path from top left to bottom right, which minimizes the sum of all numbers along its path.
Minimum Window Substring
SolveGiven two strings s and t of lengths m and n respectively, return the minimum window substring of s such that every character in t (including duplicates) is inc...
Interleaving String
SolveGiven strings s1, s2, and s3, find whether s3 is formed by an interleaving of s1 and s2.
Flatten Binary Tree to Linked List
SolveGiven the root of a binary tree, flatten the tree into a "linked list":
Reverse Linked List II
SolveGiven the head of a singly linked list and two integers left and right where left <= right, reverse the nodes of the list from position left to position right,...
Reverse Nodes in k-Group
SolveGiven the head of a linked list, reverse the nodes of the list k at a time, and return the modified list.
Edit Distance
SolveGiven two strings word1 and word2, return the minimum number of operations required to convert word1 to word2.
Reorder List
SolveYou are given the head of a singly linked-list. The list can be represented as:
Merge k Sorted Lists
SolveYou are given an array of k linked-lists lists, each linked-list is sorted in ascending order.
Construct Binary Tree from Preorder and Inorder Traversal
SolveGiven two integer arrays preorder and inorder where preorder is the preorder traversal of a binary tree and inorder is the inorder traversal of the same tree, c...
Single Number II
SolveGiven an integer array nums where every element appears three times except for one, which appears exactly once. Find the single element and return it.
Word Ladder
SolveA transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 -> s2 -> ... -> sk such that:
Sort List
SolveGiven the head of a linked list, return the list after sorting it in ascending order.
Find Minimum in Rotated Sorted Array
SolveSuppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become:
Copy List with Random Pointer
SolveA linked list of length n is given such that each node contains an additional random pointer, which could point to any node in the list, or null.
Clone Graph
SolveGiven a reference of a node in a connected undirected graph.
Pascal's Triangle II
SolveGiven an integer rowIndex, return the rowIndexth (0-indexed) row of the Pascal's triangle.
Rotate List
SolveGiven the head of a linked list, rotate the list to the right by k places.
Search in Rotated Sorted Array II
SolveThere is an integer array nums sorted in non-decreasing order (not necessarily with distinct values).
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Yahoo interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Yahoo interviews focus heavily on array, string, dynamic-programming problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Yahoo interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Yahoo has been reported to ask 100 distinct coding problems. The most common topics are array, string, dynamic-programming. 25 are Easy difficulty, 63 are Medium, and 12 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 100 reported problems, Yahoo interviews are in line with industry averages - 12% Hard vs 18% overall. 63% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, string, dynamic-programming. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Yahoo coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Yahoo interview with AIarrow_forward