Indeed coding interview
questions, leaked.
7 problems reported across recent Indeed interviews. Top patterns: array, hash table, counting. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Indeed's OA leans heavily on array manipulation and hash-table lookups. You're looking at 7 problems across two medium rounds, with 5 array-focused questions dominating the distribution. That's your core diet. The hard problems pull in dynamic programming and divide-and-conquer tactics, so don't sleep on those patterns. Most candidates freeze when a DP constraint appears mid-problem. If you hit a wall on the live OA, StealthCoder reads the problem, surfaces a working solution in seconds, and stays invisible to the proctor. But first, you need to know what you're walking into.
Top problems at Indeed
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Sum of Even Numbers After Queries | MEDIUM | 100.0 | 69% | Array · Simulation |
| 02 | Minimum Moves to Equal Array Elements | MEDIUM | 100.0 | 58% | Array · Math |
| 03 | Minimum Cost to Split an Array | HARD | 100.0 | 42% | Array · Hash Table · Dynamic Programming |
| 04 | Find Players With Zero or One Losses | MEDIUM | 100.0 | 73% | Array · Hash Table · Sorting |
| 05 | Binary Tree Tilt | EASY | 100.0 | 64% | Tree · Depth-First Search · Binary Tree |
| 06 | Merge k Sorted Lists | HARD | 79.3 | 57% | Linked List · Divide and Conquer · Heap (Priority Queue) |
| 07 | Check if Every Row and Column Contains All Numbers | EASY | 72.8 | 53% | Array · Hash Table · Matrix |
Frequencies derived from public community-tagged interview reports. Click a row to view on LeetCode.
You have a week, maybe less. You can't out-grind the list above. StealthCoder runs invisibly during the actual Indeed OA. The proctor cannot see it. Screen share cannot detect it. Built by an Amazon engineer who realized the OA tests how well you memorized 200 problems, not how well you code.
Get StealthCoder- array5 · 71%
- hash table3 · 43%
- counting2 · 29%
- linked list1 · 14%
- divide and conquer1 · 14%
- heap priority queue1 · 14%
- merge sort1 · 14%
- simulation1 · 14%
- math1 · 14%
- dynamic programming1 · 14%
Arrays are the clear centerline here. You'll see them combined with simulation, math, and hash-table checks across both difficulty tiers. The medium problems test your ability to track state changes and count or categorize results efficiently. Two of the hard problems require you to chain advanced patterns together: one merges sorted structures with heap logic and divide-and-conquer, the other splices arrays, hash tables, DP, and counting into a single problem. That's a pattern-stacking setup. Hash tables show up in roughly 40 percent of the set, so fluency with hash-set operations for collision detection and frequency counts is non-negotiable. Trees and linked lists appear once each, which means they're your knowledge insurance, not your drilling focus. StealthCoder is the hedge for whatever pattern you didn't have time to internalize before the OA goes live.
Companies with similar patterns
If you prepped for Indeed, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Indeed.
Memorizing every problem above in a week is a fantasy. StealthCoder is the hedge: an AI overlay that's invisible during screen share. It reads the problem on screen and surfaces a working solution in under 2 seconds. Built by an Amazon engineer who realized the OA tests how well you memorized 200 problems, not how well you code. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Indeed interview FAQ
How many array problems should I solve before the Indeed OA?+
Array problems make up more than half the set. Drill 10 to 15 array-based problems that combine simulation, math, or hash-table checks. Focus on problems that require you to modify state in place or aggregate results based on multiple passes through the data.
Do I need to study dynamic programming for Indeed?+
Yes. One of the two hard problems is explicitly DP-heavy (Minimum Cost to Split an Array). DP accounts for only one problem, but it's a hard one. Spend 3 to 4 hours on DP state transitions and memoization before the OA.
Should I prioritize linked-list and tree prep for Indeed?+
No. Linked lists and trees each appear once in the dataset. They're edge cases, not core topics. Drill them only if you've already mastered arrays and hash tables. Use your time on the 5 array problems instead.
What's the hardest pattern I'll face on Indeed's OA?+
Merge k Sorted Lists is the most complex. It chains linked-list traversal, divide-and-conquer splitting, and heap priority-queue operations. It's a pattern stacker. Practice the merging logic separately before combining all three.
Can I skip hash-table study for Indeed?+
No. Hash tables appear in 3 out of 7 problems, often paired with arrays for counting or deduplication. You need fast frequency-map and set-collision logic. Plan 2 to 3 hours on hash-table patterns before the OA.