Problem database last updated: June 20, 2025
20 problems · 5 Easy, 13 Medium, 2 Hard · Ranked #94 of 458
5 Easy
25% · avg 23%
13 Medium
65% · avg 59%
2 Hard
10% · avg 18%
Based on 20 reported problems, Wayfair interviews are in line with industry averages - 10% Hard vs 18% overall. The majority (65%) 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, Wayfair puts unusual emphasis on simulation (10% of problems, 2.3x the industry average), string (60% of problems, 2.1x the industry average), sliding-window (10% of problems, 2.1x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are string (60%), array (35%), dynamic-programming (25%), two-pointers (25%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Maximum Product Subarray Given an integer array nums, find a subarray that has the largest product, and return the product. | Medium | Very Likely | arraydynamic-programming | Solve |
Largest Magic Square A k x k magic square is a k x k grid filled with integers such that every row sum, every column sum, and both diagonal sums are all equal. The integers in the m... | Medium | Very Likely | arraymatrixprefix-sum | Solve |
Minimum Moves to Reach Target Score You are playing a game with integers. You start with the integer 1 and you want to reach the integer target. | Medium | Very Likely | mathgreedy | Solve |
Delete Characters to Make Fancy String A fancy string is a string where no three consecutive characters are equal. | Easy | Very Likely | string | Solve |
Longest Happy String A string s is called happy if it satisfies the following conditions: | Medium | Very Likely | stringgreedyheap-priority-queue | Solve |
Maximum Number of Balloons Given a string text, you want to use the characters of text to form as many instances of the word "balloon" as possible. | Easy | Very Likely | hash-tablestringcounting | Solve |
Alert Using Same Key-Card Three or More Times in a One Hour Period LeetCode company workers use key-cards to unlock office doors. Each time a worker uses their key-card, the security system saves the worker's name and the time... | Medium | Very Likely | arrayhash-tablestring | Solve |
Best Sightseeing Pair You are given an integer array values where values[i] represents the value of the ith sightseeing spot. Two sightseeing spots i and j have a distance j - i betw... | Medium | Very Likely | arraydynamic-programming | Solve |
Add Strings Given two non-negative integers, num1 and num2 represented as string, return the sum of num1 and num2 as a string. | Easy | Very Likely | mathstringsimulation | Solve |
Longest Palindromic Substring Given a string s, return the longest palindromic substring in s. | Medium | Very Likely | two-pointersstringdynamic-programming | 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 |
Reaching Points Given four integers sx, sy, tx, and ty, return true if it is possible to convert the point (sx, sy) to the point (tx, ty) through some operations, or false othe... | Hard | Likely | math | 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 | Likely | two-pointersstring | Solve |
Maximum Number of Vowels in a Substring of Given Length Given a string s and an integer k, return the maximum number of vowel letters in any substring of s with length k. | Medium | Likely | stringsliding-window | Solve |
Longest Increasing Subsequence Given an integer array nums, return the length of the longest strictly increasing subsequence. | Medium | Likely | arraybinary-searchdynamic-programming | Solve |
Reverse Words in a String Given an input string s, reverse the order of the words. | Medium | Likely | two-pointersstring | Solve |
Sliding Window Maximum You are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see... | Hard | Likely | arrayqueuesliding-window | Solve |
Last Person to Fit in the Bus Table: Queue | Medium | Likely | database | Solve |
Backspace String Compare Given two strings s and t, return true if they are equal when both are typed into empty text editors. '' means a backspace character. | Easy | Likely | two-pointersstringstack | Solve |
Palindromic Substrings Given a string s, return the number of palindromic substrings in it. | Medium | Likely | two-pointersstringdynamic-programming | Solve |
Maximum Product Subarray
SolveGiven an integer array nums, find a subarray that has the largest product, and return the product.
Largest Magic Square
SolveA k x k magic square is a k x k grid filled with integers such that every row sum, every column sum, and both diagonal sums are all equal. The integers in the m...
Minimum Moves to Reach Target Score
SolveYou are playing a game with integers. You start with the integer 1 and you want to reach the integer target.
Delete Characters to Make Fancy String
SolveA fancy string is a string where no three consecutive characters are equal.
Longest Happy String
SolveA string s is called happy if it satisfies the following conditions:
Maximum Number of Balloons
SolveGiven a string text, you want to use the characters of text to form as many instances of the word "balloon" as possible.
Alert Using Same Key-Card Three or More Times in a One Hour Period
SolveLeetCode company workers use key-cards to unlock office doors. Each time a worker uses their key-card, the security system saves the worker's name and the time...
Best Sightseeing Pair
SolveYou are given an integer array values where values[i] represents the value of the ith sightseeing spot. Two sightseeing spots i and j have a distance j - i betw...
Add Strings
SolveGiven two non-negative integers, num1 and num2 represented as string, return the sum of num1 and num2 as a string.
Longest Palindromic Substring
SolveGiven a string s, return the longest palindromic substring in s.
Group Anagrams
SolveGiven an array of strings strs, group the anagrams together. You can return the answer in any order.
Reaching Points
SolveGiven four integers sx, sy, tx, and ty, return true if it is possible to convert the point (sx, sy) to the point (tx, ty) through some operations, or false othe...
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...
Maximum Number of Vowels in a Substring of Given Length
SolveGiven a string s and an integer k, return the maximum number of vowel letters in any substring of s with length k.
Longest Increasing Subsequence
SolveGiven an integer array nums, return the length of the longest strictly increasing subsequence.
Reverse Words in a String
SolveGiven an input string s, reverse the order of the words.
Sliding Window Maximum
SolveYou are given an array of integers nums, there is a sliding window of size k which is moving from the very left of the array to the very right. You can only see...
Backspace String Compare
SolveGiven two strings s and t, return true if they are equal when both are typed into empty text editors. '' means a backspace character.
Palindromic Substrings
SolveGiven a string s, return the number of palindromic substrings in it.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Wayfair interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Wayfair interviews focus heavily on string, array, 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. Wayfair 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.
Wayfair has been reported to ask 20 distinct coding problems. The most common topics are string, array, dynamic-programming. 5 are Easy difficulty, 13 are Medium, and 2 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 20 reported problems, Wayfair interviews are in line with industry averages - 10% Hard vs 18% overall. 65% 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: string, array, 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 Wayfair coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Wayfair interview with AIarrow_forward
