Apple Coding Interview Questions
39 problems · 16 Easy 20 Medium 3 Hard
Apple problems
Apple interviewers favor straightforward array, string, and tree problems with subtle edge cases. Recursion and linked-list manipulation show up regularly. Code that compiles on the first try and memory-conscious solutions score well — Apple tends to value correctness over exotic algorithms.
Two Pointers 3 problems
Prefix Sum 2 problems
| Product of Array Except Self | Medium | ||
| Running Sum of 1D Array | Easy |
Hash Map / Set 4 problems
| Two Sum | Easy | ||
| Valid Anagram | Easy | ||
| Contains Duplicate | Easy | ||
| LRU Cache | Medium |
Heap / Priority Queue 1 problems
Linked List 5 problems
| Reverse Linked List | Easy | ||
| Merge Two Sorted Lists | Easy | ||
| Add Two Numbers | Medium | ||
| Remove Nth Node From End of List | Medium | ||
| Palindrome Linked List | Easy |
Trees / DFS 3 problems
| Invert Binary Tree | Easy | ||
| Binary Tree Maximum Path Sum | Hard | ||
| Sum Root to Leaf Numbers | Medium |
Dynamic Programming 7 problems
| Climbing Stairs | Easy | ||
| Unique Paths | Medium | ||
| Maximum Subarray | Medium | ||
| Partition Equal Subset Sum | Medium | ||
| Best Time to Buy and Sell Stock | Easy | ||
| Maximum Product Subarray | Medium | ||
| Triangle | Medium |
Monotonic Stack 1 problems
Bit Manipulation 4 problems
| Single Number | Easy | ||
| Number of 1 Bits | Easy | ||
| Reverse Bits | Easy | ||
| Power of Two | Easy |
Matrix 5 problems
| Rotate Image | Medium | ||
| Spiral Matrix | Medium | ||
| Set Matrix Zeroes | Medium | ||
| Maximal Square | Medium | ||
| Search a 2D Matrix II | Medium |
Binary Search 1 problems
Backtracking 1 problems
Stack 1 problems
| Basic Calculator II | Medium |