Upload Button Icon Add office photos
Premium Employer

i

This company page is being actively managed by Apple Team. If you also belong to the team, you can get access from here

Apple

Compare button icon Compare button icon Compare
4.3

based on 522 Reviews

Filter interviews by

Apple Software Developer Intern Interview Questions, Process, and Tips

Updated 16 Sep 2021

Top Apple Software Developer Intern Interview Questions and Answers

  • Q1. Kevin and his Fruits Kevin has ‘N’ buckets each consisting of some fruits. Kevin wants to eat at least ‘M’ fruits and so, he decided to set a marker (integer) as maximum ...read more
  • Q2. 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 “U ...read more
  • Q3. 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 ca ...read more
View all 6 questions

Apple Software Developer Intern Interview Experiences

2 interviews found

I was interviewed in May 2021.

Round 1 - Video Call 

(1 Question)

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...

  • 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...
  • Answered by CodingNinjas
Round 2 - Video Call 

(2 Questions)

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...

  • 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...

  • Answered by CodingNinjas
  • 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...

  • 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 ...

  • Answered by CodingNinjas
Round 3 - HR 

(1 Question)

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.

  • Q1. Basic HR Questions

    Who is your role model.

    Tell me about yourself.

  • Ans. 

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

  • Answered by CodingNinjas

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Malaviya National Institute of Technology Jaipur. I applied for the job as SDE - Intern in BangaloreEligibility criteriaCGPAApple interview preparation:Topics to prepare for the interview - primarily DSA, linked list, stack, queue, graphs and tree, DPTime required to prepare for the interview - 12 monthsInterview preparation tips for other job seekers

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

Application resume tips for other job seekers

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

Final outcome of the interviewSelected

I was interviewed in Mar 2021.

Round 1 - Video Call 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Hard

Interview was conducted at zoom in the evening hours.

  • Q1. Max GCD Pair

    You are given an array of positive integers. Find the GCD(Greatest Common Divisor) of a pair of elements such that it is maximum among all possible pairs. GCD(a, b) is the maximum number x suc...

  • Ans. Brute force

    If a number is a divisor of two or more elements then it can be the GCD of the pair formed using those elements.

     

    In this method, we will iterate over all the elements in the array and find the divisors of every element. We will also maintain a count array where the index represents the divisor and the value at that index is the number of elements in the given array having this as a divisor.

     

    After t...

  • Answered by CodingNinjas
  • Q2. Kevin and his Fruits

    Kevin has ‘N’ buckets each consisting of some fruits. Kevin wants to eat at least ‘M’ fruits and so, he decided to set a marker (integer) as maximum as possible such that if he eats “n...

  • Ans. Brute Force

    First, we should know that the marker can’t be negative and also it will not be greater than the maximum number of fruits in a particular bucket because if this happens then Kevin are not able to eat any of these fruits.

     

     Therefore, the marker must be in the range of 0 to a maximum number of fruits in a particular bucket. So, the idea is to first calculate the maximum number of fruits in any partic...

  • Answered by CodingNinjas
Round 2 - HR 

(1 Question)

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.

  • Q1. Basic Questions

    What is expectation from this job?

    What are your hobbies?

    Some puzzles.

  • Ans. 

    his puzzle usually seems like a tough one to answer, but solving it once makes one realize that the procedure was actually simple. If the candidate pulls out 2 red balls, he replaces them with a blue ball.
    On the other hand, if he draws one red and one blue, it is replaced with a red one. This implies that the red ball would always be in odd numbers, whether the candidate removes 2 together, or removes 1 while adding 1....

  • Answered by CodingNinjas

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Malaviya National Institute of Technology Jaipur. I applied for the job as SDE - Intern in HyderabadEligibility criteriaabove 6.5 cgpa, only CS and ECE branch allowedApple interview preparation:Topics to prepare for the interview - Data structures, OOPS, Algorithms, Operating System, DBMSTime required to prepare for the interview - 12 monthsInterview preparation tips for other job seekers

Tip 1 : Data structures and algorithms are the most fundamental and important thing to prepare.
Tip 2 : Don't ignore OOPS.
Tip 3 : Solve DSA questions regularly.

Application resume tips for other job seekers

Tip 1 : Avoid unnecessary details like hobbies, date of birth, parent's name, photo, etc., and keep it one-pager.
Tip 2 : Add a link to your GitHub, LinkedIn, website, phone number, etc.

Final outcome of the interviewSelected

Skills evaluated in this interview

Software Developer Intern Interview Questions Asked at Other Companies

Q1. Sum Of Max And MinYou are given an array “ARR” of size N. Your ta ... read more
asked in CommVault
Q2. Sliding Maximum You are given an array 'ARR' of integers of lengt ... read more
asked in Amazon
Q3. Fish EaterThere is a river which flows in one direction. One day, ... read more
Q4. Program to check the validity of a PasswordNinjas are trying to h ... read more
Q5. Find K Closest ElementsYou are given a sorted array 'A' of length ... read more

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Easy Binary search and tree questions were asked

Round 2 - Technical 

(2 Questions)

  • Q1. Binary search on rotated array
  • Ans. 

    Binary search on rotated array involves finding a target element in a sorted array that has been rotated.

    • Find the pivot point where the array is rotated

    • Determine which half of the array the target element lies in

    • Perform binary search on the appropriate half of the array

  • Answered by AI
  • Q2. ACID in dbms was asked
  • Ans. 

    ACID is a set of properties that guarantee database transactions are processed reliably.

    • ACID stands for Atomicity, Consistency, Isolation, Durability.

    • Atomicity ensures that all operations in a transaction are completed successfully or none at all.

    • Consistency ensures that the database remains in a consistent state before and after the transaction.

    • Isolation ensures that multiple transactions can be executed concurrently ...

  • Answered by AI

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Walk-in and was interviewed in Oct 2024. There was 1 interview round.

Round 1 - HR 

(2 Questions)

  • Q1. Why you want to join company
  • Q2. Puzzle question

Interview Preparation Tips

Interview preparation tips for other job seekers - solve previous year question of sri delhi 6 month intern and practice some puzzle. focus on topics like tree, graph,dfs,bfs,shortest path , linked list more.
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

Easy to medium questions

Round 2 - Hackathon 

(1 Question)

  • Q1. Create a software
  • Ans. 

    A software for managing inventory in a retail store

    • Create a user-friendly interface for adding, updating, and deleting products

    • Include features for tracking sales, restocking inventory, and generating reports

    • Implement barcode scanning functionality for quick product lookup

  • Answered by AI
Round 3 - HR 

(1 Question)

  • Q1. Tell me about yourself

Interview Preparation Tips

Interview preparation tips for other job seekers - Just stick to the basics

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
Selected Selected

I was interviewed in Mar 2024.

Round 1 - Coding Test 

Aptitude and dsa questions

Round 2 - Technical 

(2 Questions)

  • Q1. Sql, Oops, dsa, API and projects were asked
  • Q2. Some sql queries
Round 3 - HR 

(1 Question)

  • Q1. Normal interaction to know about me
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(3 Questions)

  • Q1. 1. Check all the permutations of palindrome in an array
  • Ans. 

    Find all permutations of palindromes in an array of strings.

    • Iterate through each string in the array.

    • For each string, generate all possible permutations.

    • Check if each permutation is a palindrome.

    • Return the list of palindromic permutations.

  • Answered by AI
  • Q2. 2. Toggle a bit
  • Ans. 

    Toggle a bit in a binary number

    • Convert the number to binary representation

    • Identify the bit position to toggle

    • Toggle the bit using bitwise XOR operator

    • Convert the modified binary number back to decimal

  • Answered by AI
  • Q3. 3. Swap numbers using bit operators
  • Ans. 

    Swapping numbers using bit operators.

    • Use XOR operator to swap two numbers without using a temporary variable

    • XORing a number with itself results in 0

    • Example: a = 5, b = 7. a ^= b; b ^= a; a ^= b; // a = 7, b = 5

  • Answered by AI

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Company Website and was interviewed before Feb 2022. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - HR 

(2 Questions)

  • Q1. Why do want to work here?
  • Ans. 

    I want to work here because of the company's reputation, the opportunity for growth, and the chance to work on innovative projects.

    • Company's reputation: The company has a strong reputation in the industry for its high-quality software development work.

    • Opportunity for growth: I believe that working here will provide me with ample opportunities to learn and grow as a software developer.

    • Innovative projects: I am excited a...

  • Answered by AI
  • Q2. Tell me about yourself?
  • Ans. 

    I am a software development intern with a passion for coding and problem-solving.

    • Currently pursuing a degree in Computer Science

    • Proficient in programming languages such as Java, C++, and Python

    • Experience with web development frameworks like React and Angular

    • Completed several projects including a mobile app for task management

    • Strong problem-solving and analytical skills

  • Answered by AI
Round 3 - Technical 

(1 Question)

  • Q1. Questions were regarding my previous internships and projects

Interview Preparation Tips

Interview preparation tips for other job seekers - just prepare from your resume, white board leetcode type questions are unilikely

I was interviewed in Nov 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 70 minutes
Round difficulty - Medium

It was held at 7:00 pm. STL functions were not allowed. But STL containers like queues were allowed. One question was easy-medium, one was medium and one was hard. Everyone got different sets of questions. Make sure you solve all the questions from Samsung online Test, as they tend to repeat. Only 2 sample test cases were visible and Other Test Cases were hidden.

  • Q1. Game of Stones

    Given the count of total stones in a game. Two-player ‘Ale’ and ‘Bob’ are playing the game. Your task is to find who will win the game if both the players are playing optimally.

    Rules of t...

  • Ans. Game Theory
    • It is clear that if the number of stones is ‘1’ then ‘Ale’ wins the game. If ‘2’ then also ‘Ale’ wins the match, and if ‘3’ then ‘Bob’ wins the game.
    • So we can observe that, if anyone has a chance to choose a stone from ‘3’ number of stones then another opponent will the game. If ‘Ale’ choosing the stones from ‘3’ number stone then ‘Bob’ will win and vice versa.
    • If the number of stones is ‘4’ then ‘Ale’ will w...
  • Answered by CodingNinjas
  • Q2. Largest Number in Binary Tree

    You have been given a Binary Tree of 'N' nodes where the nodes have integer values.

    Your task is to find the largest number that could be formed by concatenating all...

  • Ans. Sorting

    A simple solution would be to store all the node values to the list/array by traversing the whole Binary Tree and the problem now is that given a list of non-negative integers, arrange them such that they form the largest number. To solve this problem, sort the array in descending order, but sorting the list/array does not work here.

     

    The idea is to use any of the comparison-based sorting algorithms.

     

    1. We...
  • Answered by CodingNinjas
  • Q3. Bridges In A Graph

    Given an undirected graph of V vertices and E edges. Your task is to find all the bridges in the given undirected graph. A bridge in any graph is defined as an edge which, when removed, ...

  • Ans. Brute Force

    The brute force approach to find all the bridges in a given graph is to check for every edge if it is a bridge or not, by first not considering current edge is not in given graph and then checking if the vertices that it was connecting are still connected or not, using DFS(DepthFirst Search). Given below is an algorithm that will find all bridges in a graph.

     

    Algorithm :

    1. Initialise a visited array with fa...
  • Answered by CodingNinjas
Round 2 - Coding Test 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The interviewer was very friendly. It started at 10:00 AM and lasted for 60 minutes. It was the only technical interview and NO HR interview was there. The video was kept on with screen sharing.

  • Q1. Sum of Digits

    Ninja is given an integer ‘N’. One day Ninja decides to do the sum of all digits and replace the ‘N’ with the sum of digits until it becomes less than 10. Ninja wants to find what will be the...

  • Ans. Brute Force Approach

    The main idea is to do the sum of digits until it becomes less than 10.

     

    Algorithm:

    • Add a condition if N is less than 10 then return N.
    • Do the sum of all digits.
    • Make a recursive call and pass the sum of digits as N.
    • Return the answer which you get from a recursive call.
    Space Complexity: O(1)Explanation:

    O(1).

     

    We are using constant space to solve this.

    Time Complexity: OtherExplanation:

    O(log10(...

  • Answered by CodingNinjas
  • Q2. Sum Of Squares Of First N Natural Numbers

    You are given an integer 'N'. You need to find the sum of squares of the first 'N' natural numbers.

    For example:
    If 'N' = 4. You need to ...
  • Ans. Brute Force - Recursive
    • Write a recursive solution for adding the sum of the squares of the first ‘N’ natural numbers.
    • The base case would be the sum of the first natural number, which is 1.
    • Sum up the squares of each number from 1 to ‘N’.
    • Finally, return this sum.
    Space Complexity: O(1)Explanation:

    O(N), where ‘N’ is the given number.

    Considering the recursive stack space.

    Time Complexity: O(1)Explanation:

    O(N), where ‘N’ is...

  • Answered by CodingNinjas
  • Q3. Convert A Given Binary Tree To Doubly Linked List

    Given a Binary Tree, convert this binary tree to a Doubly Linked List.

    A Binary Tree (BT) is a data structure in which each node has at most two children...

  • Ans. Recursive Solution - 1
    • If the left subtree exists, recursively convert the left subtree to Doubly Linked List.
    • If the right subtree exists, recursively convert the right subtree to Doubly Linked List.
    • When in the left subtree, find the inorder predecessor of the root, make this as the previous of the root and its next as the root.
    • Similarly, when in the right subtree, find the inorder successor of the root, make this as th...
  • Answered by CodingNinjas
  • Q4. Output Question

    class A{    int n;    public :    void fun(A *a){        if(n == a->n){             cout << "Both val...

  • Ans. 

    I said No. But the answer to this question is Yes this code is will compile.
    He was trying to ask that if a data member is private then if you declare 2 objects(let's say o1,o2) for that class. Then can you access the data member of a second object using the first object?

  • Answered by CodingNinjas

Interview Preparation Tips

Eligibility criteriaCircuital Branches(CSE, ECE,EE) having CGPA more than 7Samsung interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, Objected Oriented Programming, DBMS, SQL, Operating SystemTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Never mention anything in RESUME in which you're not confident
Tip 2 : For on-campus opportunities try to maintain a good CGPA. Try to maintain at least 7.5 CGPA
Tip 3 : While practicing questions please make sure you make notes if them, it will be mostly required if your interview is scheduled in 1-2 days.
Tip 4 : Never submit questions just for the sake of increasing the count on problems solved. Try to think of one problem from a different perspective. 
Tip 5 : Please give timed contests it will be helpful in clearing ONLINE TESTS. Please note Interviews are easier than Online Tests and mostly standard questions are asked.

Application resume tips for other job seekers

Tip 1 : Mention only those things you feel confident
Tip 2 : If you're DSA heavy mention ranking if any, the number of problems solved. And if you're development heavy include projects and 2-3 lines about each project.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

3h test with 1question

Round 2 - Technical 

(1 Question)

  • Q1. Realted to oa and virtual function
Round 3 - HR 

(1 Question)

  • Q1. Normal hr and puzzle

Tell us how to improve this page.

Apple Software Developer Intern Reviews and Ratings

based on 1 review

4.0/5

Rating in categories

4.0

Skill development

4.0

Work-Life balance

4.0

Salary & Benefits

4.0

Job Security

5.0

Company culture

4.0

Promotions/Appraisal

4.0

Work Satisfaction

Explore 1 Review and Rating
Software Engineer
169 salaries
unlock blur

₹16 L/yr - ₹61 L/yr

Sales Executive
106 salaries
unlock blur

₹1.6 L/yr - ₹5 L/yr

Ipro
105 salaries
unlock blur

₹2 L/yr - ₹4.6 L/yr

Software Developer
77 salaries
unlock blur

₹11.1 L/yr - ₹46.6 L/yr

Senior Software Engineer
65 salaries
unlock blur

₹14.8 L/yr - ₹63 L/yr

Explore more salaries
Compare Apple with

Google

4.4
Compare

Amazon

4.1
Compare

Microsoft Corporation

4.1
Compare

Samsung

4.0
Compare

Calculate your in-hand salary

Confused about how your in-hand salary is calculated? Enter your annual salary (CTC) and get your in-hand salary
Did you find this page helpful?
Yes No
write
Share an Interview