Nike interview experience Real time questions & tips from candidates to crack your interview

SDE - Intern

Nike

2 rounds | 3 Coding problems

Anonymous

Fresher | Oct 2022

Rejected

Interview preparation journey

Preparation

Duration: 3 months

Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming

Tip

Tip 1 : Start with the basics if you have lost touch with competitive coding. Don't directly jump to interview questions.
Tip 2 : Create a timetable and set goals. Keep aside 3-4 hours for studying. Consistency is the key.
Tip 3 : Focus on medium and hard questions. Solving a lot of easy questions doesn't help.

Application process

Where: Other

Eligibility: Above 6 CGPA

Resume tip

Tip 1 : Link to your projects.
Tip 2 : Open source contribution.
Tip 3 : Clear Tech-stack.
Tip 4 : Link to your different profiles.

Interview rounds

Round

Easy

Video Call

Duration45 mins

Interview date14 Oct 2022

Coding problem1

1. House Robber

Moderate

26m average time

0/80

Asked in companies

A thief wants to loot houses. He knows the amount of money in each house. He cannot loot two consecutive houses. Find the maximum amount of money he can loot.

Problem approach

Find maximum possible stolen value from houses

There are n houses build in a line, each of which contains some value in it. A thief is going to steal the maximal value of these houses, but he can’t steal in two adjacent houses because the owner of the stolen houses will tell his two neighbours left and right side. What is the maximum stolen value?

Examples:

Input: hval[] = {6, 7, 1, 3, 8, 2, 4}

Output: 19

Explanation: The thief will steal 6, 1, 8 and 4 from the house.

Input: hval[] = {5, 3, 4, 11, 2}

Output: 16

Explanation: Thief will steal 5 and 11

Try solving now

Round

Easy

Video Call

Duration45 mins

Interview date14 Oct 2022

Coding problem2

1. Ceil from BST

Easy

15m average time

85% success

0/40

Asked in companies

Ninja is given a binary search tree and an integer. Now he is given a particular key in the tree and returns its ceil value. Can you help Ninja solve the problem?

Note:

Ceil of an integer is the closest integer greater than or equal to a given number.
For example:
arr[] = {1, 2, 5, 7, 8, 9}, key = 3.
The closest integer greater than 3 in the given array is 5. So, its ceil value in the given array is 5.

Problem approach

Ninja is given a binary search tree and an integer. Now he is given a particular key in the tree and returns its ceil value. Can you help Ninja solve the problem?

Try solving now