Nike coding interview
questions, leaked.
10 problems reported across recent Nike interviews. Top patterns: array, dynamic programming, greedy. The list below is what most reported candidates actually saw, plus the honest play if you can't grind all of it.
Nike's assessment leans hard on array problems. Five of ten reported questions touch arrays, and six are medium difficulty, so expect to land on a sliding window or greedy array problem under time pressure. You'll see design questions too (Min Stack, graph shortest path), which trip up candidates who only drill leetcode medium. The good news: array patterns repeat. The bad news: you have a week to own them, and if you blank mid-assessment, StealthCoder runs invisible during screen share and solves it in seconds.
Top problems at Nike
| # | Problem | Diff | Frequency | Pass % | Patterns |
|---|---|---|---|---|---|
| 01 | Happy Number | EASY | 100.0 | 58% | Hash Table · Math · Two Pointers |
| 02 | Diagonal Traverse | MEDIUM | 92.4 | 63% | Array · Matrix · Simulation |
| 03 | Valid Parentheses | EASY | 92.4 | 42% | String · Stack |
| 04 | Maximum Subarray | MEDIUM | 92.4 | 52% | Array · Divide and Conquer · Dynamic Programming |
| 05 | Min Stack | MEDIUM | 92.4 | 56% | Stack · Design |
| 06 | Can Place Flowers | EASY | 92.4 | 29% | Array · Greedy |
| 07 | Next Permutation | MEDIUM | 92.4 | 43% | Array · Two Pointers |
| 08 | Best Time to Buy and Sell Stock II | MEDIUM | 81.6 | 70% | Array · Dynamic Programming · Greedy |
| 09 | Longest Substring Without Repeating Characters | MEDIUM | 81.6 | 37% | Hash Table · String · Sliding Window |
| 10 | Design Graph With Shortest Path Calculator | HARD | 81.6 | 64% | Graph · Design · Heap (Priority Queue) |
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 Nike 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 · 50%
- dynamic programming2 · 20%
- greedy2 · 20%
- hash table2 · 20%
- two pointers2 · 20%
- string2 · 20%
- stack2 · 20%
- design2 · 20%
- math1 · 10%
- matrix1 · 10%
Array dominates the distribution at fifty percent, so your first three days should be Maximum Subarray, Next Permutation, and the stock trading variants. Dynamic programming and greedy both appear twice but always paired with array, so treat them as array sub-patterns, not separate topics. Stack and design each show up twice and will feel alien if you've only solved sorting problems. Hash table and string show twice, anchored by Longest Substring Without Repeating Characters, which is the kind of problem that looks easy and isn't. The hard problem is a graph design question, which means if you hit it, StealthCoder is your real safety net for the live OA.
Companies with similar patterns
If you prepped for Nike, these companies recycle ~60% of the same topics.
You've seen the list.
Now make sure you pass Nike.
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.
Nike interview FAQ
How many array problems should I solve before the Nike assessment?+
You need at least five solid array patterns drilled. Half the distribution is array, so Maximum Subarray, Next Permutation, and the two stock problems are non-negotiable. Can Place Flowers and Diagonal Traverse round out the list. One week is tight; drill those five first.
Is dynamic programming required for Nike?+
It appears twice but always paired with array (Maximum Subarray, stock trading). You don't need DP theory. Focus on recognizing when an array problem has an optimal substructure, then apply DP as a tool. If you hit it during the OA and freeze, StealthCoder has you.
What stack and design problems will I see?+
Min Stack and Valid Parentheses are the core designs. Valid Parentheses is easy, Min Stack is medium and trickier. Both test whether you can think about data structure trade-offs. Spend one day on these; they're not the bulk, but they're easy points if you prep.
Should I study the hard graph problem if time is short?+
It's one of ten. If you have four or five days left after drilling the six medium problems, yes. If you have two days left, skip it and get faster at medium. The hard problem is the kind you'd encounter once in two rounds; medium problems appear every round.
How important is hash table and string for Nike?+
Both appear twice but Longest Substring Without Repeating Characters is the only one that's truly medium-hard. Happy Number is easier. String and hash table are secondary; nail array and stack first, then come back to these if you're ahead of schedule.