Target coding interview
questions, leaked.
4 problems reported across recent Target interviews. Top patterns: array, two pointers, sorting. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Target's coding assessment hits you with four problems, all array-heavy, and three of them are medium difficulty. You're looking at classic patterns like two-pointers sorting, prefix-sum design problems, and at least one hard graph traversal that requires DFS and topological thinking. The array dominance is not accidental. If you haven't drilled two-pointers and prefix-sum mechanics in the last week, you're walking in cold. StealthCoder sits invisible during the live assessment and surfaces working solutions the moment you hit a wall, so you're never actually stuck mid-interview.
Top problems at Target
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Sort Colors | MEDIUM | 100.0 | 68% | Array · Two Pointers · Sorting |
| 02 | Longest Path With Different Adjacent Characters | HARD | 100.0 | 54% | Array · String · Tree |
| 03 | Product of the Last K Numbers | MEDIUM | 100.0 | 63% | Array · Math · Design |
| 04 | Maximum Subarray | MEDIUM | 100.0 | 52% | Array · Divide and Conquer · Dynamic Programming |
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 Target OA. The proctor cannot see it. Screen share cannot detect it. Built by an engineer at a top-10 tech company who can solve these problems cold but didn't want to trust himself in a 90-minute screen share.
Get StealthCoder- array4 · 100%
- two pointers1 · 25%
- sorting1 · 25%
- string1 · 25%
- tree1 · 25%
- depth first search1 · 25%
- graph1 · 25%
- topological sort1 · 25%
- math1 · 25%
- design1 · 25%
Every single problem Target asks involves arrays, which means your foundation there has to be solid. Three are medium, one is hard, so you're not facing a gauntlet of impossible leetcode 2700-level nonsense, but the hard problem strings together tree, graph, DFS, and topological sort into a single multi-topic monster. That's where most candidates panic and time out. The medium problems are more forgiving: Sort Colors is a classic two-pointer warm-up, Product of the Last K Numbers teaches prefix-sum and design pattern thinking, and Maximum Subarray is Kadane's algorithm territory. Your first 48 hours should go to two-pointers and prefix-sum, because those appear across multiple problems. The hard problem is your hedge case. Even if you haven't seen the exact pattern before, StealthCoder runs invisibly during screen share and hands you a working solution so you can move forward.
Companies with similar patterns
If you prepped for Target, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Target.
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 engineer at a top-10 tech company who can solve these problems cold but didn't want to trust himself in a 90-minute screen share. Works on HackerRank, CodeSignal, CoderPad, and Karat.
Target interview FAQ
Should I study two-pointers or prefix-sum first for Target?+
Two-pointers. Sort Colors is a direct warm-up and trains the skill for other array manipulations. Prefix-sum comes next because Product of the Last K Numbers requires it. Both appear in Target's problem set, but two-pointers is the faster win and builds confidence early.
Is Maximum Subarray actually asked at Target?+
Yes. It's one of Target's top four problems and it's medium difficulty. This is a dynamic programming / divide-and-conquer classic, not a trick question. Know Kadane's algorithm cold. You should be able to code it in under two minutes.
What makes the hard problem so hard?+
Longest Path With Different Adjacent Characters combines tree, graph, DFS, and topological sort into one problem. Most candidates see graph and freeze. It requires you to model the constraint correctly and traverse it. Expect this to take 20-30 minutes even if you're strong on DFS.
How many array problems should I solve before the assessment?+
Target asks four problems and all four involve arrays. Drill at least 10-15 array problems across two-pointers, prefix-sum, and sorting to build muscle memory. Three of Target's are medium, so focus there first, then one hard graph-array hybrid.
Can I skip the hard problem and still pass Target?+
Probably not. With only four total problems, the hard one counts heavily. You need to get the three mediums right and attempt the hard credibly. Don't skip it in prep. Spend your last few hours understanding the DFS and topological sort pieces of it.