Apple Interview Questions, Process, and Tips

Q1. Take knowledge of your products
Add your answer
Q2. Question about your last work
Add your answer

Some coding test related to coding languages

Some case study like giving percentage of user and then find out how much people will like it

Q1. What do you consider your biggest failure ?
Add your answer
Q2. If you had to select between Work or Family; which one would you at a dire situation in both instances?
Add your answer

Two easy-medium lc questions

Round duration - 45 minutes
Round difficulty - Medium

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.

Q1. Ninja And Candies
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 co...read more
Ans. Using Linear Search
We will iterate over all possible days, which will be between 1 to 2*(sum of all K[i]). Let our current day be ‘currDay’. We will check if any valid distribution is possible for the current day.
If we had several days for some type of candies, let's use the last one, it is always not worse than some of the previous days. Then let's iterate over all days from 1 to ‘ansd’ and do the following: 
• Firs...read more
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Hard

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

Q1. Umbrella
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...read more
Ans. Brute Force
Approach: The idea here is to try every possible option and consider the minimum ans.

 We have two possible options: either we use the i-th umbrella to cover people or not. 

So, the recurrence for the above problem is:
minNumberOfUmbrellas(i, M) = min(minNumberOfUmbrellas(i - 1, M), 1+ minNumberOfUmbrellas(i, M - UMBRELLA[i])).
 
minNumberOfUmbrellas(i, M) represents the minimum number of umbrellas...read more
Answered Anonymously
Add your answer
Q2. Lazy Santa
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 “di...read more
Ans. Brute Force
We can note that it is always optimal to distribute gifts to ‘K’ children who are adjacent to each other. 
 
For example, if the position of children are [2, 4, 7] and K = 2, it is optimal to give gifts to children with positions 2 and 4. If the positions were to be [2, 5, 7], it is optimal to give gifts to children at positions 5 and 7. In general, if the positions are [p1, p2, p3] where p1 < p2 ...read more
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

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