Problem database last updated: June 20, 2025
7 problems · 3 Easy, 4 Medium, 0 Hard · Ranked #194 of 458
3 Easy
43% · avg 23%
4 Medium
57% · avg 59%
0 Hard
0% · avg 18%
Based on 7 reported problems, Whatnot interviews are easier than average - only 0% Hard compared to 18% across all companies. The majority (57%) 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, Whatnot puts unusual emphasis on matrix (42.9% of problems, 4.8x the industry average), depth-first-search (28.6% of problems, 3.1x the industry average), two-pointers (28.6% 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 array (71.4%), string (57.1%), matrix (42.9%), depth-first-search (28.6%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Number of Islands Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. | Medium | Very Likely | arraydepth-first-searchbreadth-first-search | Solve |
Valid Palindrome II Given a string s, return true if the s can be palindrome after deleting at most one character from it. | Easy | Very Likely | two-pointersstringgreedy | Solve |
Group Anagrams Given an array of strings strs, group the anagrams together. You can return the answer in any order. | Medium | Very Likely | arrayhash-tablestring | Solve |
Remove All Adjacent Duplicates In String You are given a string s consisting of lowercase English letters. A duplicate removal consists of choosing two adjacent and equal letters and removing them. | Easy | Very Likely | stringstack | Solve |
Squares of a Sorted Array Given an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order. | Easy | Very Likely | arraytwo-pointerssorting | Solve |
Search a 2D Matrix II Write an efficient algorithm that searches for a value target in an m x n integer matrix matrix. This matrix has the following properties: | Medium | Very Likely | arraybinary-searchdivide-and-conquer | Solve |
Word Search Given an m x n grid of characters board and a string word, return true if word exists in the grid. | Medium | Very Likely | arraystringbacktracking | Solve |
Number of Islands
SolveGiven an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands.
Valid Palindrome II
SolveGiven a string s, return true if the s can be palindrome after deleting at most one character from it.
Group Anagrams
SolveGiven an array of strings strs, group the anagrams together. You can return the answer in any order.
Remove All Adjacent Duplicates In String
SolveYou are given a string s consisting of lowercase English letters. A duplicate removal consists of choosing two adjacent and equal letters and removing them.
Squares of a Sorted Array
SolveGiven an integer array nums sorted in non-decreasing order, return an array of the squares of each number sorted in non-decreasing order.
Search a 2D Matrix II
SolveWrite an efficient algorithm that searches for a value target in an m x n integer matrix matrix. This matrix has the following properties:
Word Search
SolveGiven an m x n grid of characters board and a string word, return true if word exists in the grid.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Whatnot interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Whatnot interviews focus heavily on array, string, matrix 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. Whatnot 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.
Whatnot has been reported to ask 7 distinct coding problems. The most common topics are array, string, matrix. 3 are Easy difficulty, 4 are Medium, and 0 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 7 reported problems, Whatnot interviews are easier than average - only 0% Hard compared to 18% across all companies. 57% 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, matrix. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Whatnot coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Whatnot interview with AIarrow_forward
