Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding Ninjas X Naukri.com
Apple interview experience Real time questions & tips from candidates to crack your interview

SDE - Intern

Apple
upvote
share-icon
3 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Journey
When I was in school time, the field of Computer Science excited me. Then, I got admission to MNIT, Jaipur, because I always dreamed of being a Software Developer, so I started to get into that line of learning. I learned DSA and web Development to build my resume, an attractive resume. I applied to the Apple SDE intern in my third year of graduation, and getting an intern profile to write in your resume is a must.
Application story
I got to know that Apple was hiring an SDE intern when I was in the third year of my graduation. I applied through Internshala and received a mail from them that I was assigned an assessment test. I passed that test, and then the interview process started and at last, I was selected for that role.
Why selected/rejected for the role?
I think I had the appropriate skills and a good amount of knowledge to prove that I was the right man for the post. I also solved coding questions in an optimal manner.
Preparation
Duration: 12 months
Topics: primarily DSA, linked list, stack, queue, graphs and tree, DP
Tip
Tip

Tip 1 : Aptitude is must.
Tip 2 : Practice puzzle problems.
Tip 3 : Do atleast 2 projects.

Application process
Where: Campus
Eligibility: CGPA
Resume Tip
Resume tip

Tip 1 : projects should be well mentioned
Tip 2 : also don't forget to mention your grades of all academic levels

Interview rounds

01
Round
Medium
Video Call
Duration45 minutes
Interview date26 May 2021
Coding problem1

This round was scheduled in the morning hours from 10:30 to 11:15 AM. I was informed about the round 2 days earlier through an e-mail and a phone call both.

1. Ninja And Candies

Moderate
15m average time
85% success
0/80
Asked in companies
Goldman SachsAmazonApple

Ninja is a boy who lives in ninjaland. Every day, during the morning he gets 1 coin from his mother. He wants to buy exactly ‘N’ candies. Each of the candies cost 2 coins usually and 1 coin if it is on sale. Ninja has to buy exactly K[i] candies of the i-th type(he buys candies in the evening).

Ninjas can buy any(possibly zero) number of candies of any type during any day(if he has enough money to do it). If the candy is on sale he can buy it for 1 coin and otherwise he has to buy it for 2 coins.

There are ‘M’ special offers in the candy shop. The j-th offer (D[j], C[j]) means that candies of the C[j]-th type are on sale during the D[j]-th day.

Ninja wants to buy all candies as soon as possible. Your task is to calculate the minimum day when he can buy all the candies.

Try solving now
02
Round
Hard
Video Call
Duration45 minutes
Interview date28 May 2021
Coding problem2

After the first round, some candidates were shortlisted and I was one of them which was scheduled 2 days later at the same time.

1. Umbrella

Moderate
25m average time
75% success
0/80
Asked in companies
FacebookVisaGoldman Sachs

You are given ‘N’ types of umbrellas, where each umbrella can shelter some number of people. Given the number of people each umbrella can shelter in the array “UMBRELLA”, you need to determine the minimum number of umbrellas required to cover exactly ‘M’ people with umbrellas.

Note -

You have an infinite number of umbrellas of each type.
If it is not possible to shelter exactly ‘M’ people then print -1. 
Try solving now

2. Lazy Santa

Easy
0/40
Asked in companies
AppleIBMSimplify VMS

It’s christmas and Santa is here with ‘K’ gifts. There are ‘N’ children in the park who are standing in a straight line, and not crowding up due to COVID restrictions. You are given an array “distance” containing ‘N’ integers where “distance[i]” denotes the distance of the ith child from the gate of the park in meters. Each child stands at a different distance from the gate.

Since Santa is still on his reindeer, he can land at any position in the park. But once he lands on the ground, he uses his feet to walk. Santa is very lazy and is requesting you to find the minimum distance he needs to travel on his feet so that he can distribute all the ‘K’ gifts to ‘K’ different children.

Example:
Let there be 6 children and 3 gifts. If the position of the children is [3, 6, 7, 10, 17, 25], the minimum distance Santa has to walk is 4m which can be achieved in many ways, one of them being Santa landing at the 1st child and walking till the 3rd child (distance = (6m - 3m) + (7m - 6m) = 4m).
Try solving now
03
Round
Medium
HR Round
Duration30 minutes
Interview date29 May 2021
Coding problem1

It was a simple conversation, no shortlisting was done here, all of the students who passed the previous round were offered the role.

1. Basic HR Questions

Who is your role model.

Tell me about yourself.

Problem approach

Tip 1 : try to be practical whenever claiming something
Tip 2 : try to be honest and disciplined with your answers

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

How do you write a single-line comment in C++?

Choose another skill to practice
Start a Discussion
Similar interview experiences
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Apple
2233 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 4 problems
Interviewed by Apple
1857 views
0 comments
0 upvotes
company logo
Intern
2 rounds | 3 problems
Interviewed by Apple
2132 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 6 problems
Interviewed by Apple
1363 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - Intern
3 rounds | 6 problems
Interviewed by Amazon
13360 views
4 comments
0 upvotes
company logo
SDE - Intern
4 rounds | 7 problems
Interviewed by Microsoft
12384 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Amazon
8920 views
2 comments
0 upvotes