Problem database last updated: June 20, 2025
7 problems · 2 Easy, 3 Medium, 2 Hard · Ranked #197 of 458
2 Easy
29% · avg 23%
3 Medium
43% · avg 59%
2 Hard
29% · avg 18%
Based on 7 reported problems, Indeed interviews are significantly harder than average - 29% Hard vs 18% across all companies.
Compared to the industry average, Indeed puts unusual emphasis on counting (28.6% of problems, 8.6x the industry average), hash-table (42.9% of problems, 1.9x 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%), hash-table (42.9%), counting (28.6%), tree (14.3%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Binary Tree Tilt Given the root of a binary tree, return the sum of every tree node's tilt. | Easy | Very Likely | treedepth-first-searchbinary-tree | Solve |
Minimum Moves to Equal Array Elements Given an integer array nums of size n, return the minimum number of moves required to make all array elements equal. | Medium | Very Likely | arraymath | Solve |
Sum of Even Numbers After Queries You are given an integer array nums and an array queries where queries[i] = [vali, indexi]. | Medium | Very Likely | arraysimulation | Solve |
Minimum Cost to Split an Array You are given an integer array nums and an integer k. | Hard | Very Likely | arrayhash-tabledynamic-programming | Solve |
Find Players With Zero or One Losses You are given an integer array matches where matches[i] = [winneri, loseri] indicates that the player winneri defeated player loseri in a match. | Medium | Very Likely | arrayhash-tablesorting | Solve |
Merge k Sorted Lists You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. | Hard | Very Likely | linked-listdivide-and-conquerheap-priority-queue | Solve |
Check if Every Row and Column Contains All Numbers An n x n matrix is valid if every row and every column contains all the integers from 1 to n (inclusive). | Easy | Likely | arrayhash-tablematrix | Solve |
Binary Tree Tilt
SolveGiven the root of a binary tree, return the sum of every tree node's tilt.
Minimum Moves to Equal Array Elements
SolveGiven an integer array nums of size n, return the minimum number of moves required to make all array elements equal.
Sum of Even Numbers After Queries
SolveYou are given an integer array nums and an array queries where queries[i] = [vali, indexi].
Minimum Cost to Split an Array
SolveYou are given an integer array nums and an integer k.
Find Players With Zero or One Losses
SolveYou are given an integer array matches where matches[i] = [winneri, loseri] indicates that the player winneri defeated player loseri in a match.
Merge k Sorted Lists
SolveYou are given an array of k linked-lists lists, each linked-list is sorted in ascending order.
Check if Every Row and Column Contains All Numbers
SolveAn n x n matrix is valid if every row and every column contains all the integers from 1 to n (inclusive).
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Indeed interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Indeed interviews focus heavily on array, hash-table, counting 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. Indeed 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.
Indeed has been reported to ask 7 distinct coding problems. The most common topics are array, hash-table, counting. 2 are Easy difficulty, 3 are Medium, and 2 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 7 reported problems, Indeed interviews are significantly harder than average - 29% Hard vs 18% across all companies. 43% 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, hash-table, counting. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Indeed coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Indeed interview with AIarrow_forward
