Nike Interview Questions

#1. Happy Number

This question is very likely to be asked in your Nike interview

Determine if a number is a 'happy number'. A happy number eventually reaches 1 when replaced by the sum of the squares of its digits, repeating the process until it does.

Two Pointers

Longest Valid Parentheses

Find the length of the longest valid (well-formed) parentheses substring within a string containing only '(' and ')' characters. A valid substring has correctly matched opening and closing parentheses.

StringsStacksDynamic Programming

Very likely

If you have a Nike interview, it's very likely that you will get this question

#2. Longest Valid Parentheses

StringsStacksDynamic Programming

This question is very likely to be asked in your Nike interview

Min Stack

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. You need to implement a stack with an additional function to efficiently get the minimum value.

Stacks

Somewhat likely

If you have a Nike interview, you might get this question

#3. Min Stack

This question is somewhat likely to be asked in your Nike interview

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. You need to implement a stack with an additional function to efficiently get the minimum value.

Stacks

Diagonal Traverse

Traverse a matrix diagonally, returning the elements in a specific zig-zag order. You'll need to manage the direction and boundaries to output the elements correctly.

If you have a Nike interview, you might get this question

Somewhat likely

#4. Diagonal Traverse

Traverse a matrix diagonally, returning the elements in a specific zig-zag order. You'll need to manage the direction and boundaries to output the elements correctly.

This question is somewhat likely to be asked in your Nike interview

Valid Parentheses

Determine if a string containing parentheses is valid. A valid string has matching and properly nested opening and closing parentheses.

StringsStacks

Somewhat likely

If you have a Nike interview, you might get this question

#5. Valid Parentheses

This question is somewhat likely to be asked in your Nike interview

Determine if a string containing parentheses is valid. A valid string has matching and properly nested opening and closing parentheses.

StringsStacks

Can Place Flowers

You're given a flowerbed represented by an array of 0s and 1s, where 0 means empty and 1 means planted. Determine if you can plant a given number of new flowers without violating the rule that adjacent plots cannot be planted.

ArraysGreedy Algorithms

If you have a Nike interview, it's unlikely that you will get this question

#6. Can Place Flowers

This question is not likely to be asked in your Nike interview

ArraysGreedy Algorithms

Maximum Subarray

Find the contiguous subarray within a given array of numbers which has the largest sum. Return the sum of this subarray.

ArraysDynamic ProgrammingGreedy Algorithms

If you have a Nike interview, it's unlikely that you will get this question

#7. Maximum Subarray

ArraysDynamic ProgrammingGreedy Algorithms

Find the contiguous subarray within a given array of numbers which has the largest sum. Return the sum of this subarray.

This question is not likely to be asked in your Nike interview

Next Permutation

Given a sequence of numbers, find the next lexicographically greater permutation of the numbers. If no greater permutation exists, rearrange the numbers into the smallest possible permutation (ascending order).

If you have a Nike interview, it's unlikely that you will get this question

#8. Next Permutation

This question is not likely to be asked in your Nike interview

Jump Game

You are given an array where each element represents your maximum jump length at that position. Determine if you can reach the last index starting from the first index.

If you have a Nike interview, it's unlikely that you will get this question

#9. Jump Game

You are given an array where each element represents your maximum jump length at that position. Determine if you can reach the last index starting from the first index.

This question is not likely to be asked in your Nike interview

Longest Substring Without Repeating Characters

Find the length of the longest substring within a given string that contains no repeating characters. The substring must be contiguous.

StringsTwo PointersSliding Windows

If you have a Nike interview, it's unlikely that you will get this question

#10. Longest Substring Without Repeating Characters

StringsTwo PointersSliding Windows

Find the length of the longest substring within a given string that contains no repeating characters. The substring must be contiguous.

This question is not likely to be asked in your Nike interview

Best Time to Buy and Sell Stock II

Maximize your profit by buying and selling a stock multiple times. You're given an array representing stock prices, and can make as many transactions as you want.

If you have a Nike interview, it's unlikely that you will get this question

#11. Best Time to Buy and Sell Stock II

Maximize your profit by buying and selling a stock multiple times. You're given an array representing stock prices, and can make as many transactions as you want.

This question is not likely to be asked in your Nike interview

Design Graph With Shortest Path Calculator

Design a graph data structure that allows you to add edges and calculate the shortest path between any two nodes. Implement a shortest path algorithm to efficiently find the minimum distance.

Graphs

If you have a Nike interview, it's unlikely that you will get this question

#12. Design Graph With Shortest Path Calculator