Skip to content
Related Articles

Related Articles

Apple SDE Sheet: Interview Questions and Answers

View Discussion
Improve Article
Save Article
  • Difficulty Level :Expert
  • Last Updated :30 Aug, 2022
View Discussion
Improve Article
Save Article

Apple is one of the world’s favorite tech brands, holding a tight spot as one of the tech Big Four companies. Apple products have found their way into seemingly every household. The company only hires the best of the best and looks for whip-smart people who will push the envelope when it comes to what personal technology can do. This sheet will assist you to land a job at Apple, we have compiled all the interview questions and answers..

Apple SDE Sheet


Apple recruitment process consists of below mentioned stages:

  • Application: The process starts with an application. Apple asks motivational questions in the application for certain roles.
  • Phone interview (Up to 2 rounds): Standard, informal, 30-minute conversation with a recruiter to assess interest and team fit. The first call maybe with an internal recruiter, then a team leads. He/She might discuss your past projects and your academic and professional achievements.
  • FaceTime Interviews (Up to 5 rounds): 30-minute long 1:1 interviews to assess your technical and behavioral skills.
  • Assessment Test: It is basically a chance to network with Apple employees and learn more about the company while completing exercises-
    • Group exercises: You’ll be asked to solve problems pertaining to the specific team you’re applying for (Siri, Maps, Calendar, etc.) while being observed by Apple employees.
    • Written exercises: You will have to solve an unseen case study problem.
    • Apple roleplay exercise: The group format is intentional in order to test candidates’ public speaking skills. Candidates then break up into smaller groups and answer typical interview questions.
  • Final interview: Onsite interviews typically consist of six hours of back-to-back interviews, typically with two people at a time. candidates are tested for knowledge of algorithms and data structures and are expected to code on a laptop and whiteboard, and show an understanding of system design.

Apple SDE Roadmap


Why this Sheet?

A career at Apple is rewarding both financially and personally. The lucrative salary, employee benefits, and the chance of working with the most brilliant minds in the industry have made Apple one of the most popular employers. We have come up with this sheet to help students aspiring for a career at apple. It covers the most popular and important coding questions ever asked in Apple technical Interviews. It covers most DSA concepts as questions are grouped topic-wise.


Phone Interview: You may receive a mail where “Hi, after reviewing your application, we have shortlisted your profile for the Telephonic Interview.” will be mentioned.

Telephonic Interviews play a crucial role in reducing this barrier. However, there are many advantages of telephonic interviews such as you can appear for the interview from any place as per your convenience or you can refer back to notes, etc. but there are still some complexities and challenges integrated with Telephonic Interviews for which you have to be prepared to get the green flag for final selection.


FaceTime Interview:For the past few years, Online Interviews have seen tremendous popularity Online Job Interviews can be considered the new normal in the recruitment world. Indeed, various leading employers like Google, Microsoft, Amazon, etc. are using online job interviews for their recruitment process. Moreover, an Online Interview seems to be quite comfortable for job seekers as they can attend the interview right from their home or any other preferred place.


Coding Interview

Array: An array is a collection of items stored at contiguous memory locations. The idea is to store multiple items of the same type together.

Cyclically rotate an array by oneSolve
Program for array rotationSolve
Adding one to a number represented an an array of digitsSolve
Find the missing and repeating numberSolve
Product of Array except itselfSolve
Find the Number Occurring Odd Number of TimesSolve
Round the given number to nearest multiple of 10Solve
Elements in the RangeSolve
Find zeroes to be flipped so that number of consecutive 1’s is maximizedSolve
Equilibrium index of an arraySolve
Top k numbers in a streamSolve
Rotate a 2D array without using extra spaceSolve

String: Strings are defined as an array of characters. The difference between a character array and a string is the string is terminated with a special character ‘\0’.

Program to validate an IP addressSolve
Implement AtoiSolve
Program to Check if a Given String is PalindromeSolve
Check whether two strings are anagram of each otherSolve
Write a program to print all permutations of a given stringSolve
Remove duplicates from a given stringSolve
Find Excel column name from a given column numberSolve
Length of the longest valid substringSolve
Converting Decimal Number lying between 1 to 3999 to Roman NumeralsSolve
Given a sequence of words, print all anagrams togetherSolve
Longest prefix which is also suffixSolve
Find if an array of strings can be chained to form a circleSolve

Linked List: A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations.

Delete a Node in Single Linked ListSolve
Reverse a linked listSolve
Reverse a Linked List in groups of given sizeSolve
Check if a linked list is Circular Linked ListSolve
Multiply two numbers represented by Linked ListsSolve
Reverse a sublist of linked listSolve
Implement a stack using singly linked listSolve
Convert a given Binary Tree to Doubly Linked ListSolve
Length of longest palindrome in linked listSolve
Find length of loop in linked listSolve
Clone a linked list with next and random pointerSolve
Flatten a binary tree into linked listSolve

Stack and Queue:

  • Stack: A stack is a linear data structure in which elements can be inserted and deleted only from one side of the list, called the top. A stack follows the LIFO (Last In First Out) principle.
  • Queue: A queue is a linear data structure in which elements can be inserted only from one side of the list called the rear, and the elements can be deleted only from the other side called the front. The queue data structure follows the FIFO (First In First Out) principle.
Implement Stack using QueuesSolve
Design a stack that supports getMin() in O(1) time and O(1) extra spaceSolve
Length of the longest valid substringSolve
Reversing a QueueSolve
Find the first circular tour that visits all petrol pumpsSolve
Clone a stack without extra spaceSolve
Minimum time required to rot all orangesSolve
Maximum size rectangle binary sub-matrix with all 1sSolve
The Celebrity ProblemSolve
The Stock Span ProblemSolve

Searching: Searching Algorithms are designed to check for an element or retrieve an element from any data structure where it is stored.

Find last index of a character in a stringSolve
Number of pairs in an array with the sum greater than 0Solve
Majority ElementSolve
Find a peak elementSolve
Find the transition point in a binary arraySolve
Find common elements in three sorted arraysSolve
Leaders in an arraySolve
Find a pair with the given differenceSolve
Find bitonic point in given bitonic sequenceSolve
Capacity To Ship Packages Within D DaysSolve

Sorting: The sorting Algorithm is used to rearrange a given array or list of elements according to a comparison operator on the elements.

Sort in a specific orderSolve
K’th Smallest/Largest Element in Unsorted ArraySolve
Sort an array of 0s, 1s and 2sSolve
Count Inversions in an arraySolve
Find a triplet that sums to a given valueSolve
Find subarray with given sumSolve
Chocolate Distribution ProblemSolve
The minimum sum of two numbers formed from digits of an arraySolve
Largest even number that can be formed by any number of swapsSolve

Hash and Heap:

  • Hash: Hashing is a popular technique for storing and retrieving data as fast as possible.
  • Heap: Heap is a special case of balanced binary tree data structure where the root-node key is compared with its children and arranged accordingly
Count pairs with a given sumSolve
The longest sub-array having sum kSolve
Zero Sum SubarraysSolve
Union of Two Linked ListsSolve
Check if an array can be divided into pairs whose sum is divisible by kSolve
Longest Consecutive SubsequenceSolve
Triplet Sum in ArraySolve
Largest subarray of 0’s and 1’sSolve
Merge K sorted Linked listsSolve
Operations on Binary Min HeapSolve

Recursion and Backtracking:

  • Recursion: In recursion, a function calls itself again and again directly or indirectly.
  • Backtracking: In backtracking, we use recursion to explore all the possibilities until we get the best result for the problem.
Tower Of HanoiSolve
Recursively remove all adjacent duplicatesSolve
Backtracking to find all subsetsSolve
Special KeyboardSolve
Rat in a Maze ProblemSolve
Generate IP AddressesSolve
Lucky NumbersSolve
m Coloring ProblemSolve
Partition array to K subsetsSolve
Diagonal Sum of a Binary TreeSolve
Generate n-bit Gray CodesSolve

Tree: A tree is non-linear and a hierarchical data structure consisting of a collection of nodes such that each node of the tree stores a value, a list of references to nodes (the “children”).

Sorted Array to Balanced BSTSolve
Level Order Binary Tree TraversalSolve
Reverse Level Order TraversalSolve
Print level order traversal line by lineSolve
Left View of Binary TreeSolve
Boundary Traversal of binary treeSolve
Vertical Traversal of Binary TreeSolve
Check if two Nodes are CousinsSolve
Binary Tree to DLLSolve
Serialize and Deserialize a Binary TreeSolve
Convert a Binary Tree to a Circular Doubly Link ListSolve
A program to check if a binary tree is BST or notSolve
Find the node with minimum value in a Binary Search TreeSolve
Lowest Common Ancestor in a Binary TreeSolve
Lowest Common Ancestor in a Binary Search Tree.Solve
Maximum difference between node and its ancestor in Binary TreeSolve

Graph: A Graph is a non-linear data structure consisting of nodes and edges. The nodes are sometimes also referred to as vertices and the edges are lines or arcs that connect any two nodes in the graph.

Bipartite GraphSolve
Detect cycle in a directed graphSolve
Detect cycle in an undirected graphSolve
Topological sortSolve
Minimum Spanning TreeSolve
Minimum steps to reach target by a KnightSolve
Strongly Connected Components (Kosaraju’s Algo)Solve
Snake and Ladder ProblemSolve
Word BoggleSolve
Find whether it is possible to finish all tasks or not from given dependenciesSolve
Bridges in a graphSolve
Flood Fill AlgorithmSolve

Dynamic Programming: Dynamic Programming is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming.

Find if a string is interleaved of two other stringsSolve
Max rectangleSolve
Palindrome PartitioningSolve
Number of Unique BST with a given keySolve
Boolean Parenthesization ProblemSolve
Number of CoinsSolve
Egg Dropping PuzzleSolve
Word BreakSolve
Wildcard Pattern MatchingSolve
Total Decoding MessagesSolve
Jump GameSolve
Longest Increasing SubsequenceSolve
Painting Fence AlgorithmSolve
Count All Palindrome Sub-Strings in a StringSolve
Count ways to reach the n’th stairSolve
Burst Balloon to maximize coinsSolve

System Design

System Design is the process of designing the architecture, components, and interfaces for a system so that it meets the end-user requirements. System Design for tech interviews is something that can’t be ignored!

Almost every IT giant whether it be Facebook, Amazon, Google, Apple or any other asks various questions based on System Design concepts such as scalability, load-balancing, caching, etc. in the interview.

This specifically designed System Design tutorial will help you to learn and master System Design concepts in the most efficient way from basics to advanced level.

My Personal Notesarrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!