Apple Questions
Here are the LeetCode questions for Apple.
Total: 512
Easy: 138
Medium: 300
Hard: 74
Progress: 0%
Topic Frequency Analysis
All Topics
| Rank | Topic | Frequency | Percentage |
|---|---|---|---|
| 1 | Array | 251 | |
| 2 | String | 119 | |
| 3 | Hash Table | 105 | |
| 4 | Dynamic Programming | 84 | |
| 5 | Depth-First Search | 75 | |
| 6 | Math | 74 | |
| 7 | Two Pointers | 58 | |
| 8 | Tree | 57 | |
| 9 | Sorting | 56 | |
| 10 | Breadth-First Search | 54 | |
| 11 | Binary Tree | 51 | |
| 12 | Matrix | 44 | |
| 13 | Binary Search | 42 | |
| 14 | Stack | 41 | |
| 15 | Design | 36 | |
| 16 | Greedy | 35 | |
| 17 | Linked List | 30 | |
| 18 | Backtracking | 29 | |
| 19 | Bit Manipulation | 27 | |
| 20 | Recursion | 21 | |
| 21 | Heap (Priority Queue) | 20 | |
| 22 | Sliding Window | 19 | |
| 23 | Simulation | 18 | |
| 24 | Divide and Conquer | 17 | |
| 25 | Graph Theory | 17 | |
| 26 | Binary Search Tree | 16 | |
| 27 | Prefix Sum | 13 | |
| 28 | Counting | 12 | |
| 29 | Union-Find | 11 | |
| 30 | Trie | 11 | |
| 31 | Database | 11 | |
| 32 | Monotonic Stack | 10 | |
| 33 | Ordered Set | 10 | |
| 34 | Queue | 9 | |
| 35 | Memoization | 8 | |
| 36 | Topological Sort | 7 | |
| 37 | Segment Tree | 6 | |
| 38 | Enumeration | 6 | |
| 39 | Interactive | 5 | |
| 40 | Data Stream | 5 | |
| 41 | Iterator | 5 | |
| 42 | Hash Function | 5 | |
| 43 | Binary Indexed Tree | 4 | |
| 44 | Randomized | 4 | |
| 45 | Geometry | 3 | |
| 46 | Rolling Hash | 3 | |
| 47 | Merge Sort | 3 | |
| 48 | Doubly-Linked List | 3 | |
| 49 | Bucket Sort | 3 | |
| 50 | Game Theory | 3 | |
| 51 | Bitmask | 3 | |
| 52 | Sweep Line | 2 | |
| 53 | Shell | 2 | |
| 54 | Number Theory | 2 | |
| 55 | Quickselect | 2 | |
| 56 | Counting Sort | 2 | |
| 57 | Suffix Array | 1 | |
| 58 | String Matching | 1 | |
| 59 | Combinatorics | 1 | |
| 60 | Monotonic Queue | 1 | |
| 61 | Eulerian Circuit | 1 | |
| 62 | Shortest Path | 1 | |
| 63 | Probability and Statistics | 1 | |
| No. | Question Title | Link | Difficulty | Solved |
|---|---|---|---|---|
| 1 | Minimize Maximum Component Cost | Visit | Medium | |
| 2 | Calculate Score After Performing Instructions | Visit | Medium | |
| 3 | String Compression III | Visit | Medium | |
| 4 | Apple Redistribution into Boxes | Visit | Easy | |
| 5 | Maximum Number of Operations With the Same Score II | Visit | Medium | |
| 6 | Restricted | Restricted | Hard | |
| 7 | Restricted | Restricted | Hard | |
| 8 | Restricted | Restricted | Hard | |
| 9 | Restricted | Restricted | Hard | |
| 10 | Restricted | Restricted | Hard | |
| 11 | Restricted | Restricted | Hard | |
| 12 | Restricted | Restricted | Hard | |
| 13 | Restricted | Restricted | Hard | |
| 14 | Restricted | Restricted | Hard | |
| 15 | Restricted | Restricted | Hard |
Log in to access all 512 questions for free!
Log InFrequently Asked Questions
Common questions about Apple interviews