Nike Interview Questions — 10 DSA Problems
10 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.
Most frequently asked Nike LeetCode questions for software engineering interviews.
- Happy Number (EASY) — Hash Table, Math, Two Pointers
- Diagonal Traverse (MEDIUM) — Array, Matrix, Simulation
- Valid Parentheses (EASY) — String, Stack
- Maximum Subarray (MEDIUM) — Array, Divide and Conquer, Dynamic Programming
- Min Stack (MEDIUM) — Stack, Design
- Can Place Flowers (EASY) — Array, Greedy
- Next Permutation (MEDIUM) — Array, Two Pointers
- Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
- Design Graph With Shortest Path Calculator (HARD) — Graph, Design, Heap (Priority Queue), Shortest Path
- Best Time to Buy and Sell Stock II (MEDIUM) — Array, Dynamic Programming, Greedy
N
Nike
10 questions tracked10 with solutions
Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough
Showing 10 of 10 questions
1Hash TableMathTwo Pointers
4ArrayDivide and ConquerDynamic Programming
8Hash TableStringSliding Window
9GraphDesignHeap (Priority Queue)Shortest Path
10ArrayDynamic ProgrammingGreedy