- Interview Questions
- /
- Apple
Apple LeetCode Interview Questions
Practice 298 coding problems currently tagged to Apple. Use the frequency and topic signals to build a focused software engineering interview practice plan.
Last updated:
Top Topics at Apple
Ace your Apple interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Apple Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
LRU Cache 100% | MediumM | Solve→ |
Two Sum 86.9% | EasyE | Solve→ |
Merge Intervals 84.5% | MediumM | Solve→ |
Number of Islands 84.5% | MediumM | Solve→ |
Best Time to Buy and Sell Stock 79.3% | EasyE | Solve→ |
Design Hit Counter 79.3% | MediumM | Solve→ |
Rotate Array 78.2% | MediumM | Solve→ |
Group Anagrams 77.6% | MediumM | Solve→ |
Top K Frequent Elements 77% | MediumM | Solve→ |
Longest Common Prefix 76.4% | EasyE | Solve→ |
Valid Sudoku 75.8% | MediumM | Solve→ |
Reverse Linked List 75.8% | EasyE | Solve→ |
Course Schedule II 73% | MediumM | Solve→ |
Course Schedule 72.2% | MediumM | Solve→ |
Valid Parentheses 71.5% | EasyE | Solve→ |
Valid Palindrome 70.6% | EasyE | Solve→ |
Product of Array Except Self 69.8% | MediumM | Solve→ |
Maximum Subarray 68% | MediumM | Solve→ |
Spiral Matrix 68% | MediumM | Solve→ |
Reverse Words in a String 68% | MediumM | Solve→ |
Kth Largest Element in an Array 68% | MediumM | Solve→ |
Time Based Key-Value Store 68% | MediumM | Solve→ |
Longest Substring Without Repeating Characters 67% | MediumM | Solve→ |
Merge k Sorted Lists 67% | HardH | Solve→ |
Reverse Integer 66% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Rotate Image 66% | MediumM | Solve→ |
Best Time to Buy and Sell Stock II 66% | MediumM | Solve→ |
Subarray Product Less Than K 64.9% | MediumM | Solve→ |
Median of Two Sorted Arrays 63.7% | HardH | Solve→ |
Find First and Last Position of Element in Sorted Array 63.7% | MediumM | Solve→ |
Trapping Rain Water 63.7% | HardH | Solve→ |
Meeting Rooms II 63.7% | MediumM | Solve→ |
Subarray Sum Equals K 63.7% | MediumM | Solve→ |
Reverse Bits 62.5% | EasyE | Solve→ |
Lowest Common Ancestor of a Binary Tree 62.5% | MediumM | Solve→ |
Move Zeroes 62.5% | EasyE | Solve→ |
Insert Delete GetRandom O(1) 62.5% | MediumM | Solve→ |
Design Circular Queue 62.5% | MediumM | Solve→ |
Merge Two Sorted Lists 61.2% | EasyE | Solve→ |
Snapshot Array 61.2% | MediumM | Solve→ |
Word Ladder 59.9% | HardH | Solve→ |
Min Stack 59.9% | MediumM | Solve→ |
Basic Calculator II 59.9% | MediumM | Solve→ |
Find Median from Data Stream 59.9% | HardH | Solve→ |
Merge Sorted Array 58.4% | EasyE | Solve→ |
Word Break 58.4% | MediumM | Solve→ |
3Sum 56.8% | MediumM | Solve→ |
Climbing Stairs 56.8% | EasyE | Solve→ |
Search a 2D Matrix II 56.8% | MediumM | Solve→ |
Design Tic-Tac-Toe 56.8% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find the Index of the First Occurrence in a String 55% | EasyE | Solve→ |
Compare Version Numbers 55% | MediumM | Solve→ |
Number of 1 Bits 55% | EasyE | Solve→ |
Implement Trie (Prefix Tree) 55% | MediumM | Solve→ |
Peeking Iterator 55% | MediumM | Solve→ |
Ransom Note 55% | EasyE | Solve→ |
String Compression 55% | MediumM | Solve→ |
Best Time to Buy and Sell Stock with Transaction Fee 55% | MediumM | Solve→ |
Regular Expression Matching 53.1% | HardH | Solve→ |
Remove Duplicates from Sorted Array 53.1% | EasyE | Solve→ |
Binary Tree Level Order Traversal 53.1% | MediumM | Solve→ |
Longest Consecutive Sequence 53.1% | MediumM | Solve→ |
First Unique Character in a String 53.1% | EasyE | Solve→ |
Design HashMap 53.1% | EasyE | Solve→ |
Calculate Score After Performing Instructions 53.1% | MediumM | Solve→ |
Find Servers That Handled Most Number of Requests 53.1% | HardH | Solve→ |
Longest Palindromic Substring 51% | MediumM | Solve→ |
Remove Nth Node From End of List 51% | MediumM | Solve→ |
Sqrt(x) 51% | EasyE | Solve→ |
Pascal's Triangle 51% | EasyE | Solve→ |
Max Points on a Line 51% | HardH | Solve→ |
Delete Node in a Linked List 51% | MediumM | Solve→ |
Serialize and Deserialize Binary Tree 51% | HardH | Solve→ |
Flatten Nested List Iterator 51% | MediumM | Solve→ |
Array Nesting 51% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Number of Squareful Arrays 51% | HardH | Solve→ |
Letter Combinations of a Phone Number 48.7% | MediumM | Solve→ |
Search in Rotated Sorted Array 48.7% | MediumM | Solve→ |
Maximum Depth of Binary Tree 48.7% | EasyE | Solve→ |
Maximal Square 48.7% | MediumM | Solve→ |
Implement Queue using Stacks 48.7% | EasyE | Solve→ |
Binary Tree Paths 48.7% | EasyE | Solve→ |
Decode String 48.7% | MediumM | Solve→ |
LFU Cache 48.7% | HardH | Solve→ |
Task Scheduler 48.7% | MediumM | Solve→ |
Remove All Adjacent Duplicates In String 48.7% | EasyE | Solve→ |
Number of Pairs of Strings With Concatenation Equal to Target 48.7% | MediumM | Solve→ |
Maximum Rows Covered by Columns 48.7% | MediumM | Solve→ |
Count the Number of Incremovable Subarrays II 48.7% | HardH | Solve→ |
Count the Number of Incremovable Subarrays I 48.7% | EasyE | Solve→ |
Find the Grid of Region Average 48.7% | MediumM | Solve→ |
Container With Most Water 46% | MediumM | Solve→ |
Generate Parentheses 46% | MediumM | Solve→ |
Jump Game 46% | MediumM | Solve→ |
Two Sum II - Input Array Is Sorted 46% | MediumM | Solve→ |
Meeting Rooms 46% | EasyE | Solve→ |
Integer to English Words 46% | HardH | Solve→ |
Find K Closest Elements 46% | MediumM | Solve→ |
Flood Fill 46% | EasyE | Solve→ |
Fibonacci Number 46% | EasyE | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Find Winner on a Tic Tac Toe Game 46% | EasyE | Solve→ |
String to Integer (atoi) 43% | MediumM | Solve→ |
Permutations 43% | MediumM | Solve→ |
Insert Interval 43% | MediumM | Solve→ |
Text Justification 43% | HardH | Solve→ |
Sliding Window Maximum 43% | HardH | Solve→ |
Coin Change 43% | MediumM | Solve→ |
Reverse String 43% | EasyE | Solve→ |
Lowest Common Ancestor of a Binary Tree III 43% | MediumM | Solve→ |
Find All Lonely Numbers in the Array 43% | MediumM | Solve→ |
Design Memory Allocator 43% | MediumM | Solve→ |
Add Two Numbers 39.4% | MediumM | Solve→ |
Roman to Integer 39.4% | EasyE | Solve→ |
Set Matrix Zeroes 39.4% | MediumM | Solve→ |
Word Search 39.4% | MediumM | Solve→ |
Gas Station 39.4% | MediumM | Solve→ |
Find Peak Element 39.4% | MediumM | Solve→ |
Valid Anagram 39.4% | EasyE | Solve→ |
Cheapest Flights Within K Stops 39.4% | MediumM | Solve→ |
Middle of the Linked List 39.4% | EasyE | Solve→ |
Rotting Oranges 39.4% | MediumM | Solve→ |
Maximum Frequency Stack 39.4% | HardH | Solve→ |
Exam Room 39.4% | MediumM | Solve→ |
Distribute Money to Maximum Children 39.4% | EasyE | Solve→ |
Keys and Rooms 39.4% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Path Sum 39.4% | EasyE | Solve→ |
Best Time to Buy and Sell Stock with Cooldown 39.4% | MediumM | Solve→ |
Total Hamming Distance 39.4% | MediumM | Solve→ |
Serialize and Deserialize N-ary Tree 39.4% | HardH | Solve→ |
Edit Distance 39.4% | MediumM | Solve→ |
Combination Sum 35% | MediumM | Solve→ |
Sort Colors 35% | MediumM | Solve→ |
Interleaving String 35% | MediumM | Solve→ |
Best Time to Buy and Sell Stock III 35% | HardH | Solve→ |
Reorder List 35% | MediumM | Solve→ |
Happy Number 35% | EasyE | Solve→ |
Missing Number 35% | EasyE | Solve→ |
H-Index 35% | MediumM | Solve→ |
Odd Even Linked List 35% | MediumM | Solve→ |
Reconstruct Itinerary 35% | HardH | Solve→ |
Kth Smallest Element in a Sorted Matrix 35% | MediumM | Solve→ |
Fizz Buzz 35% | EasyE | Solve→ |
Validate IP Address 35% | MediumM | Solve→ |
Palindromic Substrings 35% | MediumM | Solve→ |
Capacity To Ship Packages Within D Days 35% | MediumM | Solve→ |
Knight Probability in Chessboard 35% | MediumM | Solve→ |
Word Ladder II 35% | HardH | Solve→ |
Alien Dictionary 35% | HardH | Solve→ |
Design Log Storage System 35% | MediumM | Solve→ |
Design Add and Search Words Data Structure 35% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximum Path Quality of a Graph 35% | HardH | Solve→ |
Convert Sorted Array to Binary Search Tree 35% | EasyE | Solve→ |
Longest Increasing Path in a Matrix 35% | HardH | Solve→ |
Brace Expansion 35% | MediumM | Solve→ |
4Sum 29.5% | MediumM | Solve→ |
Remove Element 29.5% | EasyE | Solve→ |
Jump Game II 29.5% | MediumM | Solve→ |
Permutations II 29.5% | MediumM | Solve→ |
Search a 2D Matrix 29.5% | MediumM | Solve→ |
Validate Binary Search Tree 29.5% | MediumM | Solve→ |
Same Tree 29.5% | EasyE | Solve→ |
Evaluate Reverse Polish Notation 29.5% | MediumM | Solve→ |
Find Minimum in Rotated Sorted Array 29.5% | MediumM | Solve→ |
Intersection of Two Linked Lists 29.5% | EasyE | Solve→ |
Best Time to Buy and Sell Stock IV 29.5% | HardH | Solve→ |
House Robber 29.5% | MediumM | Solve→ |
Contains Duplicate 29.5% | EasyE | Solve→ |
Basic Calculator 29.5% | HardH | Solve→ |
Binary Tree Vertical Order Traversal 29.5% | MediumM | Solve→ |
Intersection of Two Arrays 29.5% | EasyE | Solve→ |
Find All Anagrams in a String 29.5% | MediumM | Solve→ |
Island Perimeter 29.5% | EasyE | Solve→ |
Next Greater Element II 29.5% | MediumM | Solve→ |
Find Largest Value in Each Tree Row 29.5% | MediumM | Solve→ |
Continuous Subarray Sum 29.5% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Maximum Product of Three Numbers 29.5% | EasyE | Solve→ |
Top K Frequent Words 29.5% | MediumM | Solve→ |
Random Pick with Weight 29.5% | MediumM | Solve→ |
Sum of Subarray Minimums 29.5% | MediumM | Solve→ |
K Closest Points to Origin 29.5% | MediumM | Solve→ |
Apple Redistribution into Boxes 29.5% | EasyE | Solve→ |
Employee Free Time 29.5% | HardH | Solve→ |
Robot Bounded In Circle 29.5% | MediumM | Solve→ |
Best Poker Hand 29.5% | EasyE | Solve→ |
Logger Rate Limiter 29.5% | EasyE | Solve→ |
Minimum Knight Moves 29.5% | MediumM | Solve→ |
Longest Substring with At Most K Distinct Characters 29.5% | MediumM | Solve→ |
Find Pivot Index 29.5% | EasyE | Solve→ |
Design Browser History 29.5% | MediumM | Solve→ |
Read N Characters Given read4 II - Call Multiple Times 29.5% | HardH | Solve→ |
Binary Tree Right Side View 29.5% | MediumM | Solve→ |
Short Encoding of Words 29.5% | MediumM | Solve→ |
Shortest Word Distance 29.5% | EasyE | Solve→ |
Sudoku Solver 29.5% | HardH | Solve→ |
My Calendar II 29.5% | MediumM | Solve→ |
Interval List Intersections 29.5% | MediumM | Solve→ |
Shortest Path in Binary Matrix 29.5% | MediumM | Solve→ |
Paths in Matrix Whose Sum Is Divisible by K 29.5% | HardH | Solve→ |
Find the Celebrity 29.5% | MediumM | Solve→ |
Word Search II 29.5% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Parse Lisp Expression 29.5% | HardH | Solve→ |
Valid Parenthesis String 29.5% | MediumM | Solve→ |
Design Task Manager 29.5% | MediumM | Solve→ |
Maximum Swap 29.5% | MediumM | Solve→ |
Is Graph Bipartite? 29.5% | MediumM | Solve→ |
Zigzag Conversion 22% | MediumM | Solve→ |
Reverse Nodes in k-Group 22% | HardH | Solve→ |
First Missing Positive 22% | HardH | Solve→ |
Simplify Path 22% | MediumM | Solve→ |
Minimum Window Substring 22% | HardH | Solve→ |
Largest Rectangle in Histogram 22% | HardH | Solve→ |
Reverse Linked List II 22% | MediumM | Solve→ |
Symmetric Tree 22% | EasyE | Solve→ |
Binary Tree Maximum Path Sum 22% | HardH | Solve→ |
Second Highest Salary 22% | MediumM | Solve→ |
Remove Linked List Elements 22% | EasyE | Solve→ |
Count Primes 22% | MediumM | Solve→ |
The Skyline Problem 22% | HardH | Solve→ |
Contains Duplicate II 22% | EasyE | Solve→ |
Implement Stack using Queues 22% | EasyE | Solve→ |
First Bad Version 22% | EasyE | Solve→ |
Reverse Vowels of a String 22% | EasyE | Solve→ |
Design Twitter 22% | MediumM | Solve→ |
Longest Repeating Character Replacement 22% | MediumM | Solve→ |
Reverse Pairs 22% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
01 Matrix 22% | MediumM | Solve→ |
Diameter of Binary Tree 22% | EasyE | Solve→ |
Can Place Flowers 22% | EasyE | Solve→ |
Valid Palindrome II 22% | EasyE | Solve→ |
Similar String Groups 22% | HardH | Solve→ |
Maximize Distance to Closest Person 22% | MediumM | Solve→ |
Snakes and Ladders 22% | MediumM | Solve→ |
Verifying an Alien Dictionary 22% | EasyE | Solve→ |
Minimum Remove to Make Valid Parentheses 22% | MediumM | Solve→ |
Product of the Last K Numbers 22% | MediumM | Solve→ |
Dot Product of Two Sparse Vectors 22% | MediumM | Solve→ |
Determine if Two Strings Are Close 22% | MediumM | Solve→ |
Sum of Subarray Ranges 22% | MediumM | Solve→ |
First Letter to Appear Twice 22% | EasyE | Solve→ |
Shortest Distance from All Buildings 22% | HardH | Solve→ |
Web Crawler Multithreaded 22% | MediumM | Solve→ |
Max Chunks To Make Sorted 22% | MediumM | Solve→ |
String Compression III 22% | MediumM | Solve→ |
Binary Tree Zigzag Level Order Traversal 22% | MediumM | Solve→ |
Split Strings by Separator 22% | EasyE | Solve→ |
Goat Latin 22% | EasyE | Solve→ |
Guess the Word 22% | HardH | Solve→ |
Sliding Window Median 22% | HardH | Solve→ |
Image Smoother 22% | EasyE | Solve→ |
Clone Graph 22% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Walking Robot Simulation 22% | MediumM | Solve→ |
Intersection of Three Sorted Arrays 22% | EasyE | Solve→ |
Read N Characters Given Read4 22% | EasyE | Solve→ |
Optimize Water Distribution in a Village 22% | HardH | Solve→ |
Longest Common Subsequence 22% | MediumM | Solve→ |
Minimize Maximum Component Cost 22% | MediumM | Solve→ |
Substring with Concatenation of All Words 22% | HardH | Solve→ |
Binary Search Tree Iterator 22% | MediumM | Solve→ |
Minimum Speed to Arrive on Time 22% | MediumM | Solve→ |
Convert Sorted List to Binary Search Tree 22% | MediumM | Solve→ |
Maximum Population Year 22% | EasyE | Solve→ |
Counting Bits 22% | EasyE | Solve→ |
Sentence Similarity II 22% | MediumM | Solve→ |
Design Linked List 22% | MediumM | Solve→ |
Encode and Decode TinyURL 22% | MediumM | Solve→ |
Water and Jug Problem 22% | MediumM | Solve→ |
Minimum Size Subarray Sum 22% | MediumM | Solve→ |
Non-overlapping Intervals 22% | MediumM | Solve→ |
The Maze 22% | MediumM | Solve→ |
Number of Recent Calls 22% | EasyE | Solve→ |
Evaluate Division 22% | MediumM | Solve→ |
Assign Cookies 22% | EasyE | Solve→ |
Meeting Scheduler 22% | MediumM | Solve→ |
Max Area of Island 22% | MediumM | Solve→ |
One Edit Distance 22% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Exclusive Time of Functions 22% | MediumM | Solve→ |
Minimum Falling Path Sum 22% | MediumM | Solve→ |
Permutation in String 22% | MediumM | Solve→ |
Maximum Sum Circular Subarray 22% | MediumM | Solve→ |
Remove Duplicates from Sorted List II 22% | MediumM | Solve→ |
Construct Binary Tree from Preorder and Postorder Traversal 22% | MediumM | Solve→ |
Convert Object to JSON String 22% | MediumM | Solve→ |
Moving Average from Data Stream 22% | EasyE | Solve→ |
All Nodes Distance K in Binary Tree 22% | MediumM | Solve→ |
All O`one Data Structure 22% | HardH | Solve→ |
Longest Happy Prefix 22% | HardH | Solve→ |
Balanced Binary Tree 22% | EasyE | Solve→ |
Find Distance in a Binary Tree 22% | MediumM | Solve→ |
Koko Eating Bananas 22% | MediumM | Solve→ |
Next Greater Element I 22% | EasyE | Solve→ |
My Calendar I 22% | MediumM | Solve→ |
Binary Search 22% | EasyE | Solve→ |
Basic Calculator III 22% | HardH | Solve→ |
Redundant Connection 22% | MediumM | Solve→ |
Pacific Atlantic Water Flow 22% | MediumM | Solve→ |
Partition Equal Subset Sum 22% | MediumM | Solve→ |
Building H2O 22% | MediumM | Solve→ |
Spiral Matrix II 22% | MediumM | Solve→ |
Similar Companies
Explore company practice sets with a similar number of tagged coding questions.
Frequently Asked Questions
What LeetCode problems are tagged to Apple?
Our current Apple practice dataset contains 298 tagged coding problems, including LRU Cache, Two Sum, Merge Intervals. The difficulty breakdown is 74 Easy, 177 Medium, and 47 Hard problems.
How should I prepare for a Apple coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Apple interviews typically emphasize Array and String. Practice explaining your thought process while coding.
What is the difficulty level of Apple coding interviews?
Based on our data, Apple interviews include 74 Easy (25%), 177 Medium (59%), and 47 Hard (16%) problems.
Ready to ace your Apple interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required