All Apple Coding Interview Questions
256 questions we track for Apple, most frequently asked first. Practice any of them in the code editor and get AI feedback on your solution.
Start your Apple mock interviewQuestions Apple asks, live voice, scored. First one free.
- Junior27% (68)
- Mid/Senior59% (150)
- Staff15% (38)
Questionspage 3 of 3
- Similar String Groups5 companiesStaff
- Keys and Rooms10 companiesMid/Senior
- Maximize Distance to Closest Person8 companiesMid/Senior
- All Nodes Distance K in Binary Tree13 companiesMid/Senior
- Transpose Matrix7 companiesJunior
- Walking Robot Simulation9 companiesMid/Senior
- Middle of the Linked List14 companiesJunior
- Spiral Matrix III8 companiesMid/Senior
- Construct Binary Tree from Preorder and Postorder Traversal6 companiesMid/Senior
- Sum of Subarray Minimums13 companiesMid/Senior
- Snakes and Ladders12 companiesMid/Senior
- Sort an Array12 companiesMid/Senior
- Maximum Sum Circular Subarray10 companiesMid/Senior
- Minimum Falling Path Sum8 companiesMid/Senior
- Verifying an Alien Dictionary8 companiesJunior
- K Closest Points to Origin17 companiesMid/Senior
- Interval List Intersections12 companiesMid/Senior
- Rotting Oranges50 companiesMid/Senior
- Number of Squareful Arrays3 companiesStaff
- Max Consecutive Ones III19 companiesMid/Senior
- Capacity To Ship Packages Within D Days21 companiesMid/Senior
- Robot Bounded In Circle11 companiesMid/Senior
- Remove All Adjacent Duplicates In String16 companiesJunior
- Shortest Path in Binary Matrix16 companiesMid/Senior
- Longest Common Subsequence20 companiesMid/Senior
- Minimum Knight Moves12 companiesMid/Senior
- Web Crawler Multithreaded9 companiesMid/Senior
- Tree Diameter8 companiesMid/Senior
- Minimum Remove to Make Valid Parentheses11 companiesMid/Senior
- Find Winner on a Tic Tac Toe Game7 companiesJunior
- Angle Between Hands of a Clock7 companiesMid/Senior
- Magnetic Force Between Two Balls10 companiesMid/Senior
- Find Servers That Handled Most Number of Requests6 companiesStaff
- Lowest Common Ancestor of a Binary Tree III10 companiesMid/Senior
- Determine if Two Strings Are Close7 companiesMid/Senior
- Maximum Population Year9 companiesJunior
- Minimum Speed to Arrive on Time2 companiesMid/Senior
- Number of Pairs of Strings With Concatenation Equal to Target2 companiesMid/Senior
- Maximum Path Quality of a Graph5 companiesStaff
- Sum of Subarray Ranges10 companiesMid/Senior
- Find All Lonely Numbers in the Array2 companiesMid/Senior
- Best Poker Hand2 companiesJunior
- First Letter to Appear Twice2 companiesJunior
- Maximum Rows Covered by Columns1 companyMid/Senior
- Paths in Matrix Whose Sum Is Divisible by K4 companiesStaff
- Distribute Money to Maximum Children4 companiesJunior
- Split Strings by Separator3 companiesJunior
- Count the Number of Incremovable Subarrays I2 companiesJunior
- Count the Number of Incremovable Subarrays II3 companiesStaff
- Number of Changing Keys5 companiesJunior
- Find the Grid of Region Average2 companiesMid/Senior
- Maximum Number of Operations With the Same Score II2 companiesMid/Senior
- Apple Redistribution into Boxes3 companiesJunior
- String Compression III7 companiesMid/Senior
- Calculate Score After Performing Instructions1 companyMid/Senior
- Minimize Maximum Component Cost4 companiesMid/Senior