How often are these problems asked?
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Nike interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Problem database last updated: June 20, 2025
10 problems · 3 Easy, 6 Medium, 1 Hard · Ranked #143 of 458
3 Easy
30% · avg 23%
6 Medium
60% · avg 59%
1 Hard
10% · avg 18%
Based on 10 reported problems, Nike interviews are in line with industry averages - 10% Hard vs 18% overall. The majority (60%) 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, Nike puts unusual emphasis on design (20% of problems, 3.5x the industry average), greedy (20% of problems, 2.4x the industry average), stack (20% of problems, 2.3x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (50%), hash-table (20%), two-pointers (20%), stack (20%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Happy Number Write an algorithm to determine if a number n is happy. | Easy | Very Likely | hash-tablemathtwo-pointers | Solve |
Diagonal Traverse Given an m x n matrix mat, return an array of all the elements of the array in a diagonal order. | Medium | Very Likely | arraymatrixsimulation | Solve |
Min Stack Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. | Medium | Very Likely | stackdesign | Solve |
Next Permutation A permutation of an array of integers is an arrangement of its members into a sequence or linear order. | Medium | Very Likely | arraytwo-pointers | Solve |
Maximum Subarray Given an integer array nums, find the subarray with the largest sum, and return its sum. | Medium | Very Likely | arraydivide-and-conquerdynamic-programming | Solve |
Can Place Flowers You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots. | Easy | Very Likely | arraygreedy | Solve |
Valid Parentheses Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. | Easy | Very Likely | stringstack | Solve |
Design Graph With Shortest Path Calculator There is a directed weighted graph that consists of n nodes numbered from 0 to n - 1. The edges of the graph are initially represented by the given array edges... | Hard | Very Likely | graphdesignheap-priority-queue | Solve |
Best Time to Buy and Sell Stock II You are given an integer array prices where prices[i] is the price of a given stock on the ith day. | Medium | Very Likely | arraydynamic-programminggreedy | Solve |
Longest Substring Without Repeating Characters Given a string s, find the length of the longest substring without duplicate characters. | Medium | Very Likely | hash-tablestringsliding-window | Solve |
Happy Number
SolveWrite an algorithm to determine if a number n is happy.
Diagonal Traverse
SolveGiven an m x n matrix mat, return an array of all the elements of the array in a diagonal order.
Min Stack
SolveDesign a stack that supports push, pop, top, and retrieving the minimum element in constant time.
Next Permutation
SolveA permutation of an array of integers is an arrangement of its members into a sequence or linear order.
Maximum Subarray
SolveGiven an integer array nums, find the subarray with the largest sum, and return its sum.
Can Place Flowers
SolveYou have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots.
Valid Parentheses
SolveGiven a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
Design Graph With Shortest Path Calculator
SolveThere is a directed weighted graph that consists of n nodes numbered from 0 to n - 1. The edges of the graph are initially represented by the given array edges...
Best Time to Buy and Sell Stock II
SolveYou are given an integer array prices where prices[i] is the price of a given stock on the ith day.
Longest Substring Without Repeating Characters
SolveGiven a string s, find the length of the longest substring without duplicate characters.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Nike interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Nike interviews focus heavily on array, hash-table, two-pointers 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. Nike 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.
Nike has been reported to ask 10 distinct coding problems. The most common topics are array, hash-table, two-pointers. 3 are Easy difficulty, 6 are Medium, and 1 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 10 reported problems, Nike interviews are in line with industry averages - 10% Hard vs 18% overall. 60% 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, two-pointers. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Nike coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Nike interview with AIarrow_forward