Apple Software Developer Intern Interview Questions, Process, and Tips for Freshers

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 Problem
Ninja, a boy from Ninjaland, receives 1 coin every morning from his mother. He wants to purchase exactly 'N' candies. Each candy usually costs 2 coins, but it is available for 1 ...read more
Ans. 
Calculate the earliest day on which Ninja can buy all candies given the number of candy types, special offers, and Ninja's candy preferences.
• Iterate through each day and check if any special offers are available for the candies Ninja wants to buy.

• Keep track of the remaining candies Ninja needs to buy and the coins he has each day.

• Consider both regular price and sale price while making purchases.

• Return the earliest day
Answered by AI
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. 
Minimum Umbrellas Problem
You are provided with ‘N’ types of umbrellas, where each umbrella type can shelter a certain number of people. Given an array UMBRELLA that indicates the number of people each um...read more
Ans. 
Given 'N' types of umbrellas with different capacities, find the minimum number of umbrellas required to shelter exactly 'M' people.
• Iterate through the umbrella capacities and try to cover 'M' people using the minimum number of umbrellas.

• Keep track of the total number of people covered and the number of umbrellas used.

• If it is not possible to cover 'M' people exactly, return -1.

• Return the minimum number of umbrellas re
Answered by AI
Add your answer
Q2. 
Lazy Santa Problem Statement
It's Christmas and Santa has 'K' gifts to distribute. There are 'N' children standing in a straight line in the park due to COVID restrictions. You are given an array distance...read more
Ans. 
Find the minimum distance Santa must travel to distribute 'K' gifts to 'K' different children standing in a straight line.
• Sort the array 'distance' to easily calculate the minimum distance Santa has to walk.

• Calculate the difference between adjacent elements in the sorted array and sum the first 'K-1' differences to get the minimum distance.

• Return the minimum distance Santa has to walk for each test case.
Answered by AI
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.

Round duration - 45 minutes
Round difficulty - Hard

Interview was conducted at zoom in the evening hours.

Q1. 
Max GCD Pair Problem Statement
Given an array of positive integers, determine the Greatest Common Divisor (GCD) of a pair of elements such that it is the maximum among all possible pairs in the array. The...read more
Ans. 
Find the maximum GCD of a pair of elements in an array of positive integers.
• Iterate through all pairs of elements in the array to find their GCD.

• Keep track of the maximum GCD found so far.

• Use Euclidean algorithm to calculate GCD efficiently.

• Return the maximum GCD value found.
Answered by AI
Add your answer
Q2. 
Kevin and his Fruits Problem Statement
Kevin has 'N' buckets, each consisting of a certain number of fruits. Kevin wants to eat at least 'M' fruits. He is looking to set a marker as high as possible such ...read more
Ans. 
Find the marker value needed for Kevin to eat at least 'M' fruits from 'N' buckets.
• Iterate through each test case and calculate the marker value needed based on the number of fruits in each bucket.

• Subtract the marker value from the number of fruits in each bucket and check if the total is at least 'M'.

• Return the highest possible marker value for each test case.
Answered by AI
View 1 more answer

Round duration - 30 minutes
Round difficulty - Medium

This round was scheduled in the morning hours from 10:30 to 11 am. The interviewer was cool-minded and I really enjoyed talking to him.