Question 1

Happy Number — Nike Interview Question

Accepted Answer

"Happy Number" is a easy difficulty problem asked at Nike interviews. It covers the following topics: Hash Table, Math, Two Pointers. You can practice it on LeetCode: https://leetcode.com/problems/happy-number

Question 2

Diagonal Traverse — Nike Interview Question

Accepted Answer

"Diagonal Traverse" is a medium difficulty problem asked at Nike interviews. It covers the following topics: Array, Matrix, Simulation. You can practice it on LeetCode: https://leetcode.com/problems/diagonal-traverse

Question 3

Valid Parentheses — Nike Interview Question

Accepted Answer

"Valid Parentheses" is a easy difficulty problem asked at Nike interviews. It covers the following topics: String, Stack. You can practice it on LeetCode: https://leetcode.com/problems/valid-parentheses

Question 4

Maximum Subarray — Nike Interview Question

Accepted Answer

"Maximum Subarray" is a medium difficulty problem asked at Nike interviews. It covers the following topics: Array, Divide and Conquer, Dynamic Programming. You can practice it on LeetCode: https://leetcode.com/problems/maximum-subarray

Question 5

Min Stack — Nike Interview Question

Accepted Answer

"Min Stack" is a medium difficulty problem asked at Nike interviews. It covers the following topics: Stack, Design. You can practice it on LeetCode: https://leetcode.com/problems/min-stack

Question 6

Can Place Flowers — Nike Interview Question

Accepted Answer

"Can Place Flowers" is a easy difficulty problem asked at Nike interviews. It covers the following topics: Array, Greedy. You can practice it on LeetCode: https://leetcode.com/problems/can-place-flowers

#	Question Title	Difficulty	Frequency	Topics
1	Happy Number	EASY	100.0	Hash TableMathTwo Pointers
2	Diagonal Traverse	MEDIUM	92.4	ArrayMatrixSimulation
3	Valid Parentheses	EASY	92.4	StringStack
4	Maximum Subarray	MEDIUM	92.4	ArrayDivide and ConquerDynamic Programming
5	Min Stack	MEDIUM	92.4	StackDesign
6	Can Place Flowers	EASY	92.4	ArrayGreedy
7	Next Permutation	MEDIUM	92.4	ArrayTwo Pointers
8	Longest Substring Without Repeating Characters	MEDIUM	81.6	Hash TableStringSliding Window
9	Design Graph With Shortest Path Calculator	HARD	81.6	GraphDesignHeap (Priority Queue)+1
10	Best Time to Buy and Sell Stock II	MEDIUM	81.6	ArrayDynamic ProgrammingGreedy

Explore 450+ Companies

Companies

Nike

Nike Interview Questions

Ai Assistant Kas

Explore 450+ Companies

Companies

AA CompaniesBrowse companies

BB CompaniesBrowse companies

CC CompaniesBrowse companies

DD CompaniesBrowse companies

EE CompaniesBrowse companies

FF CompaniesBrowse companies

GG CompaniesBrowse companies

HH CompaniesBrowse companies

II CompaniesBrowse companies

JJ CompaniesBrowse companies

KK CompaniesBrowse companies

LL CompaniesBrowse companies

MM CompaniesBrowse companies

NN CompaniesBrowse companies

OO CompaniesBrowse companies

PP CompaniesBrowse companies

QQ CompaniesBrowse companies

RR CompaniesBrowse companies

SS CompaniesBrowse companies

TT CompaniesBrowse companies

UU CompaniesBrowse companies

VV CompaniesBrowse companies

WW CompaniesBrowse companies

XX CompaniesBrowse companies

YY CompaniesBrowse companies

ZZ CompaniesBrowse companies

Nike

Nike Interview Questions

Ai Assistant Kas