Skip to content

Interview Solver

FeaturesPricingHelp
Sign In
FeaturesPricingHelpSign In
  1. Interview Questions
  2. /
  3. 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: September 28, 2026

74 Easy
177 Medium
47 Hard

Top Topics at Apple

ArrayStringHash TableBreadth-First SearchDepth-First Search

Ace your Apple interview with AI

Get real-time AI assistance during your actual interview. Invisible to screensharing.

Start Free Trial

Apple Interview Problems

ProblemDifficultyDiffFrequencyTopicsAction
LRU Cache
100%
MediumM
100%
Hash TableLinked List+2
Solve→
Two Sum
86.9%
EasyE
86.9%
ArrayHash Table
Solve→
Merge Intervals
84.5%
MediumM
84.5%
ArraySorting+1
Solve→
Number of Islands
84.5%
MediumM
84.5%
ArrayDepth-First Search+3
Solve→
Best Time to Buy and Sell Stock
79.3%
EasyE
79.3%
ArrayDynamic Programming
Solve→
Design Hit Counter
79.3%
MediumM
79.3%
ArrayBinary Search+3
Solve→
Rotate Array
78.2%
MediumM
78.2%
ArrayMath+1
Solve→
Group Anagrams
77.6%
MediumM
77.6%
ArrayHash Table+2
Solve→
Top K Frequent Elements
77%
MediumM
77%
ArrayHash Table+6
Solve→
Longest Common Prefix
76.4%
EasyE
76.4%
ArrayString+1
Solve→
Valid Sudoku
75.8%
MediumM
75.8%
ArrayHash Table+1
Solve→
Reverse Linked List
75.8%
EasyE
75.8%
Linked ListRecursion
Solve→
Course Schedule II
73%
MediumM
73%
Depth-First SearchBreadth-First Search+2
Solve→
Course Schedule
72.2%
MediumM
72.2%
Depth-First SearchBreadth-First Search+3
Solve→
Valid Parentheses
71.5%
EasyE
71.5%
StringStack+1
Solve→
Valid Palindrome
70.6%
EasyE
70.6%
Two PointersString
Solve→
Product of Array Except Self
69.8%
MediumM
69.8%
ArrayPrefix Sum
Solve→
Maximum Subarray
68%
MediumM
68%
ArrayDivide and Conquer+1
Solve→
Spiral Matrix
68%
MediumM
68%
ArrayMatrix+1
Solve→
Reverse Words in a String
68%
MediumM
68%
Two PointersString
Solve→
Kth Largest Element in an Array
68%
MediumM
68%
ArrayDivide and Conquer+3
Solve→
Time Based Key-Value Store
68%
MediumM
68%
Hash TableString+2
Solve→
Longest Substring Without Repeating Characters
67%
MediumM
67%
Hash TableString+1
Solve→
Merge k Sorted Lists
67%
HardH
67%
Linked ListDivide and Conquer+3
Solve→
Reverse Integer
66%
MediumM
66%
Math
Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial
Rotate Image
66%
MediumM
66%
ArrayMath+1
Solve→
Best Time to Buy and Sell Stock II
66%
MediumM
66%
ArrayDynamic Programming+1
Solve→
Subarray Product Less Than K
64.9%
MediumM
64.9%
ArrayBinary Search+2
Solve→
Median of Two Sorted Arrays
63.7%
HardH
63.7%
ArrayBinary Search+1
Solve→
Find First and Last Position of Element in Sorted Array
63.7%
MediumM
63.7%
ArrayBinary Search
Solve→
Trapping Rain Water
63.7%
HardH
63.7%
ArrayTwo Pointers+3
Solve→
Meeting Rooms II
63.7%
MediumM
63.7%
ArrayTwo Pointers+4
Solve→
Subarray Sum Equals K
63.7%
MediumM
63.7%
ArrayHash Table+1
Solve→
Reverse Bits
62.5%
EasyE
62.5%
Divide and ConquerBit Manipulation
Solve→
Lowest Common Ancestor of a Binary Tree
62.5%
MediumM
62.5%
TreeDepth-First Search+3
Solve→
Move Zeroes
62.5%
EasyE
62.5%
ArrayTwo Pointers
Solve→
Insert Delete GetRandom O(1)
62.5%
MediumM
62.5%
ArrayHash Table+3
Solve→
Design Circular Queue
62.5%
MediumM
62.5%
ArrayLinked List+2
Solve→
Merge Two Sorted Lists
61.2%
EasyE
61.2%
Linked ListRecursion
Solve→
Snapshot Array
61.2%
MediumM
61.2%
ArrayHash Table+3
Solve→
Word Ladder
59.9%
HardH
59.9%
Hash TableString+2
Solve→
Min Stack
59.9%
MediumM
59.9%
StackDesign
Solve→
Basic Calculator II
59.9%
MediumM
59.9%
MathString+1
Solve→
Find Median from Data Stream
59.9%
HardH
59.9%
Two PointersDesign+3
Solve→
Merge Sorted Array
58.4%
EasyE
58.4%
ArrayTwo Pointers+1
Solve→
Word Break
58.4%
MediumM
58.4%
ArrayHash Table+5
Solve→
3Sum
56.8%
MediumM
56.8%
ArrayTwo Pointers+1
Solve→
Climbing Stairs
56.8%
EasyE
56.8%
MathDynamic Programming+1
Solve→
Search a 2D Matrix II
56.8%
MediumM
56.8%
ArrayBinary Search+2
Solve→
Design Tic-Tac-Toe
56.8%
MediumM
56.8%
ArrayHash Table+3
Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial
Find the Index of the First Occurrence in a String
55%
EasyE
55%
Two PointersString+4
Solve→
Compare Version Numbers
55%
MediumM
55%
Two PointersString
Solve→
Number of 1 Bits
55%
EasyE
55%
Divide and ConquerBit Manipulation
Solve→
Implement Trie (Prefix Tree)
55%
MediumM
55%
Hash TableString+2
Solve→
Peeking Iterator
55%
MediumM
55%
ArrayDesign+1
Solve→
Ransom Note
55%
EasyE
55%
Hash TableString+1
Solve→
String Compression
55%
MediumM
55%
Two PointersString
Solve→
Best Time to Buy and Sell Stock with Transaction Fee
55%
MediumM
55%
ArrayDynamic Programming+1
Solve→
Regular Expression Matching
53.1%
HardH
53.1%
StringDynamic Programming+1
Solve→
Remove Duplicates from Sorted Array
53.1%
EasyE
53.1%
ArrayTwo Pointers
Solve→
Binary Tree Level Order Traversal
53.1%
MediumM
53.1%
TreeBreadth-First Search+1
Solve→
Longest Consecutive Sequence
53.1%
MediumM
53.1%
ArrayHash Table+1
Solve→
First Unique Character in a String
53.1%
EasyE
53.1%
Hash TableString+2
Solve→
Design HashMap
53.1%
EasyE
53.1%
ArrayHash Table+3
Solve→
Calculate Score After Performing Instructions
53.1%
MediumM
53.1%
ArrayHash Table+2
Solve→
Find Servers That Handled Most Number of Requests
53.1%
HardH
53.1%
ArrayHeap (Priority Queue)+2
Solve→
Longest Palindromic Substring
51%
MediumM
51%
Two PointersString+2
Solve→
Remove Nth Node From End of List
51%
MediumM
51%
Linked ListTwo Pointers
Solve→
Sqrt(x)
51%
EasyE
51%
MathBinary Search+1
Solve→
Pascal's Triangle
51%
EasyE
51%
ArrayDynamic Programming
Solve→
Max Points on a Line
51%
HardH
51%
ArrayHash Table+4
Solve→
Delete Node in a Linked List
51%
MediumM
51%
Linked List
Solve→
Serialize and Deserialize Binary Tree
51%
HardH
51%
StringTree+4
Solve→
Flatten Nested List Iterator
51%
MediumM
51%
StackTree+4
Solve→
Array Nesting
51%
MediumM
51%
ArrayDepth-First Search
Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial
Number of Squareful Arrays
51%
HardH
51%
ArrayHash Table+5
Solve→
Letter Combinations of a Phone Number
48.7%
MediumM
48.7%
Hash TableString+1
Solve→
Search in Rotated Sorted Array
48.7%
MediumM
48.7%
ArrayBinary Search
Solve→
Maximum Depth of Binary Tree
48.7%
EasyE
48.7%
TreeDepth-First Search+2
Solve→
Maximal Square
48.7%
MediumM
48.7%
ArrayDynamic Programming+1
Solve→
Implement Queue using Stacks
48.7%
EasyE
48.7%
StackDesign+1
Solve→
Binary Tree Paths
48.7%
EasyE
48.7%
StringBacktracking+3
Solve→
Decode String
48.7%
MediumM
48.7%
StringStack+1
Solve→
LFU Cache
48.7%
HardH
48.7%
Hash TableLinked List+2
Solve→
Task Scheduler
48.7%
MediumM
48.7%
ArrayHash Table+4
Solve→
Remove All Adjacent Duplicates In String
48.7%
EasyE
48.7%
StringStack
Solve→
Number of Pairs of Strings With Concatenation Equal to Target
48.7%
MediumM
48.7%
ArrayHash Table+2
Solve→
Maximum Rows Covered by Columns
48.7%
MediumM
48.7%
ArrayBacktracking+3
Solve→
Count the Number of Incremovable Subarrays II
48.7%
HardH
48.7%
ArrayTwo Pointers+1
Solve→
Count the Number of Incremovable Subarrays I
48.7%
EasyE
48.7%
ArrayTwo Pointers+2
Solve→
Find the Grid of Region Average
48.7%
MediumM
48.7%
ArrayMatrix
Solve→
Container With Most Water
46%
MediumM
46%
ArrayTwo Pointers+1
Solve→
Generate Parentheses
46%
MediumM
46%
StringDynamic Programming+2
Solve→
Jump Game
46%
MediumM
46%
ArrayDynamic Programming+1
Solve→
Two Sum II - Input Array Is Sorted
46%
MediumM
46%
ArrayTwo Pointers+1
Solve→
Meeting Rooms
46%
EasyE
46%
ArraySorting+1
Solve→
Integer to English Words
46%
HardH
46%
MathString+1
Solve→
Find K Closest Elements
46%
MediumM
46%
ArrayTwo Pointers+4
Solve→
Flood Fill
46%
EasyE
46%
ArrayDepth-First Search+2
Solve→
Fibonacci Number
46%
EasyE
46%
MathDynamic Programming+2
Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial
Find Winner on a Tic Tac Toe Game
46%
EasyE
46%
ArrayHash Table+2
Solve→
String to Integer (atoi)
43%
MediumM
43%
String
Solve→
Permutations
43%
MediumM
43%
ArrayBacktracking
Solve→
Insert Interval
43%
MediumM
43%
Array
Solve→
Text Justification
43%
HardH
43%
ArrayString+1
Solve→
Sliding Window Maximum
43%
HardH
43%
ArrayQueue+4
Solve→
Coin Change
43%
MediumM
43%
ArrayDynamic Programming+3
Solve→
Reverse String
43%
EasyE
43%
Two PointersString
Solve→
Lowest Common Ancestor of a Binary Tree III
43%
MediumM
43%
Hash TableTwo Pointers+4
Solve→
Find All Lonely Numbers in the Array
43%
MediumM
43%
ArrayHash Table+1
Solve→
Design Memory Allocator
43%
MediumM
43%
ArrayHash Table+2
Solve→
Add Two Numbers
39.4%
MediumM
39.4%
Linked ListMath+1
Solve→
Roman to Integer
39.4%
EasyE
39.4%
Hash TableMath+1
Solve→
Set Matrix Zeroes
39.4%
MediumM
39.4%
ArrayHash Table+1
Solve→
Word Search
39.4%
MediumM
39.4%
ArrayString+3
Solve→
Gas Station
39.4%
MediumM
39.4%
ArrayGreedy
Solve→
Find Peak Element
39.4%
MediumM
39.4%
ArrayBinary Search
Solve→
Valid Anagram
39.4%
EasyE
39.4%
Hash TableString+1
Solve→
Cheapest Flights Within K Stops
39.4%
MediumM
39.4%
Dynamic ProgrammingDepth-First Search+4
Solve→
Middle of the Linked List
39.4%
EasyE
39.4%
Linked ListTwo Pointers
Solve→
Rotting Oranges
39.4%
MediumM
39.4%
ArrayBreadth-First Search+1
Solve→
Maximum Frequency Stack
39.4%
HardH
39.4%
Hash TableStack+2
Solve→
Exam Room
39.4%
MediumM
39.4%
DesignHeap (Priority Queue)+1
Solve→
Distribute Money to Maximum Children
39.4%
EasyE
39.4%
MathGreedy
Solve→
Keys and Rooms
39.4%
MediumM
39.4%
Depth-First SearchBreadth-First Search+1
Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial
Path Sum
39.4%
EasyE
39.4%
TreeDepth-First Search+2
Solve→
Best Time to Buy and Sell Stock with Cooldown
39.4%
MediumM
39.4%
ArrayDynamic Programming
Solve→
Total Hamming Distance
39.4%
MediumM
39.4%
ArrayMath+1
Solve→
Serialize and Deserialize N-ary Tree
39.4%
HardH
39.4%
StringTree+2
Solve→
Edit Distance
39.4%
MediumM
39.4%
StringDynamic Programming
Solve→
Combination Sum
35%
MediumM
35%
ArrayBacktracking
Solve→
Sort Colors
35%
MediumM
35%
ArrayTwo Pointers+3
Solve→
Interleaving String
35%
MediumM
35%
StringDynamic Programming
Solve→
Best Time to Buy and Sell Stock III
35%
HardH
35%
ArrayDynamic Programming
Solve→
Reorder List
35%
MediumM
35%
Linked ListTwo Pointers+2
Solve→
Happy Number
35%
EasyE
35%
Hash TableMath+2
Solve→
Missing Number
35%
EasyE
35%
ArrayHash Table+4
Solve→
H-Index
35%
MediumM
35%
ArraySorting+1
Solve→
Odd Even Linked List
35%
MediumM
35%
Linked List
Solve→
Reconstruct Itinerary
35%
HardH
35%
ArrayString+7
Solve→
Kth Smallest Element in a Sorted Matrix
35%
MediumM
35%
ArrayBinary Search+3
Solve→
Fizz Buzz
35%
EasyE
35%
MathString+1
Solve→
Validate IP Address
35%
MediumM
35%
String
Solve→
Palindromic Substrings
35%
MediumM
35%
Two PointersString+1
Solve→
Capacity To Ship Packages Within D Days
35%
MediumM
35%
ArrayBinary Search
Solve→
Knight Probability in Chessboard
35%
MediumM
35%
Dynamic Programming
Solve→
Word Ladder II
35%
HardH
35%
Hash TableString+3
Solve→
Alien Dictionary
35%
HardH
35%
ArrayString+5
Solve→
Design Log Storage System
35%
MediumM
35%
Hash TableString+2
Solve→
Design Add and Search Words Data Structure
35%
MediumM
35%
StringDepth-First Search+2
Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial
Maximum Path Quality of a Graph
35%
HardH
35%
ArrayBacktracking+1
Solve→
Convert Sorted Array to Binary Search Tree
35%
EasyE
35%
ArrayDivide and Conquer+3
Solve→
Longest Increasing Path in a Matrix
35%
HardH
35%
ArrayDynamic Programming+7
Solve→
Brace Expansion
35%
MediumM
35%
StringBacktracking+3
Solve→
4Sum
29.5%
MediumM
29.5%
ArrayTwo Pointers+1
Solve→
Remove Element
29.5%
EasyE
29.5%
ArrayTwo Pointers
Solve→
Jump Game II
29.5%
MediumM
29.5%
ArrayDynamic Programming+1
Solve→
Permutations II
29.5%
MediumM
29.5%
ArrayBacktracking+1
Solve→
Search a 2D Matrix
29.5%
MediumM
29.5%
ArrayBinary Search+1
Solve→
Validate Binary Search Tree
29.5%
MediumM
29.5%
TreeDepth-First Search+2
Solve→
Same Tree
29.5%
EasyE
29.5%
TreeDepth-First Search+2
Solve→
Evaluate Reverse Polish Notation
29.5%
MediumM
29.5%
ArrayMath+1
Solve→
Find Minimum in Rotated Sorted Array
29.5%
MediumM
29.5%
ArrayBinary Search
Solve→
Intersection of Two Linked Lists
29.5%
EasyE
29.5%
Hash TableLinked List+1
Solve→
Best Time to Buy and Sell Stock IV
29.5%
HardH
29.5%
ArrayDynamic Programming
Solve→
House Robber
29.5%
MediumM
29.5%
ArrayDynamic Programming
Solve→
Contains Duplicate
29.5%
EasyE
29.5%
ArrayHash Table+1
Solve→
Basic Calculator
29.5%
HardH
29.5%
MathString+2
Solve→
Binary Tree Vertical Order Traversal
29.5%
MediumM
29.5%
Hash TableTree+4
Solve→
Intersection of Two Arrays
29.5%
EasyE
29.5%
ArrayHash Table+3
Solve→
Find All Anagrams in a String
29.5%
MediumM
29.5%
Hash TableString+1
Solve→
Island Perimeter
29.5%
EasyE
29.5%
ArrayDepth-First Search+2
Solve→
Next Greater Element II
29.5%
MediumM
29.5%
ArrayStack+1
Solve→
Find Largest Value in Each Tree Row
29.5%
MediumM
29.5%
TreeDepth-First Search+2
Solve→
Continuous Subarray Sum
29.5%
MediumM
29.5%
ArrayHash Table+3
Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial
Maximum Product of Three Numbers
29.5%
EasyE
29.5%
ArrayMath+1
Solve→
Top K Frequent Words
29.5%
MediumM
29.5%
ArrayHash Table+6
Solve→
Random Pick with Weight
29.5%
MediumM
29.5%
ArrayMath+3
Solve→
Sum of Subarray Minimums
29.5%
MediumM
29.5%
ArrayDynamic Programming+2
Solve→
K Closest Points to Origin
29.5%
MediumM
29.5%
ArrayMath+6
Solve→
Apple Redistribution into Boxes
29.5%
EasyE
29.5%
ArrayGreedy+1
Solve→
Employee Free Time
29.5%
HardH
29.5%
ArraySweep Line+2
Solve→
Robot Bounded In Circle
29.5%
MediumM
29.5%
MathString+1
Solve→
Best Poker Hand
29.5%
EasyE
29.5%
ArrayHash Table+1
Solve→
Logger Rate Limiter
29.5%
EasyE
29.5%
Hash TableDesign+1
Solve→
Minimum Knight Moves
29.5%
MediumM
29.5%
Breadth-First SearchHeuristic Search+2
Solve→
Longest Substring with At Most K Distinct Characters
29.5%
MediumM
29.5%
Hash TableString+1
Solve→
Find Pivot Index
29.5%
EasyE
29.5%
ArrayPrefix Sum
Solve→
Design Browser History
29.5%
MediumM
29.5%
ArrayLinked List+4
Solve→
Read N Characters Given read4 II - Call Multiple Times
29.5%
HardH
29.5%
ArraySimulation+1
Solve→
Binary Tree Right Side View
29.5%
MediumM
29.5%
TreeDepth-First Search+2
Solve→
Short Encoding of Words
29.5%
MediumM
29.5%
ArrayHash Table+2
Solve→
Shortest Word Distance
29.5%
EasyE
29.5%
ArrayString
Solve→
Sudoku Solver
29.5%
HardH
29.5%
ArrayHash Table+4
Solve→
My Calendar II
29.5%
MediumM
29.5%
ArrayBinary Search+4
Solve→
Interval List Intersections
29.5%
MediumM
29.5%
ArrayTwo Pointers+1
Solve→
Shortest Path in Binary Matrix
29.5%
MediumM
29.5%
ArrayBreadth-First Search+1
Solve→
Paths in Matrix Whose Sum Is Divisible by K
29.5%
HardH
29.5%
ArrayDynamic Programming+1
Solve→
Find the Celebrity
29.5%
MediumM
29.5%
Two PointersGraph Theory+1
Solve→
Word Search II
29.5%
HardH
29.5%
ArrayString+3
Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial
Parse Lisp Expression
29.5%
HardH
29.5%
Hash TableString+2
Solve→
Valid Parenthesis String
29.5%
MediumM
29.5%
StringDynamic Programming+3
Solve→
Design Task Manager
29.5%
MediumM
29.5%
Hash TableDesign+2
Solve→
Maximum Swap
29.5%
MediumM
29.5%
MathGreedy
Solve→
Is Graph Bipartite?
29.5%
MediumM
29.5%
Depth-First SearchBreadth-First Search+4
Solve→
Zigzag Conversion
22%
MediumM
22%
String
Solve→
Reverse Nodes in k-Group
22%
HardH
22%
Linked ListRecursion
Solve→
First Missing Positive
22%
HardH
22%
ArrayHash Table
Solve→
Simplify Path
22%
MediumM
22%
StringStack
Solve→
Minimum Window Substring
22%
HardH
22%
Hash TableString+1
Solve→
Largest Rectangle in Histogram
22%
HardH
22%
ArrayStack+2
Solve→
Reverse Linked List II
22%
MediumM
22%
Linked List
Solve→
Symmetric Tree
22%
EasyE
22%
TreeDepth-First Search+2
Solve→
Binary Tree Maximum Path Sum
22%
HardH
22%
Dynamic ProgrammingTree+3
Solve→
Second Highest Salary
22%
MediumM
22%
Database
Solve→
Remove Linked List Elements
22%
EasyE
22%
Linked ListRecursion
Solve→
Count Primes
22%
MediumM
22%
ArrayMath+5
Solve→
The Skyline Problem
22%
HardH
22%
ArrayDivide and Conquer+6
Solve→
Contains Duplicate II
22%
EasyE
22%
ArrayHash Table+1
Solve→
Implement Stack using Queues
22%
EasyE
22%
StackDesign+1
Solve→
First Bad Version
22%
EasyE
22%
Binary SearchInteractive
Solve→
Reverse Vowels of a String
22%
EasyE
22%
Two PointersString
Solve→
Design Twitter
22%
MediumM
22%
Hash TableLinked List+2
Solve→
Longest Repeating Character Replacement
22%
MediumM
22%
Hash TableString+1
Solve→
Reverse Pairs
22%
HardH
22%
ArrayBinary Search+6
Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial
01 Matrix
22%
MediumM
22%
ArrayDynamic Programming+2
Solve→
Diameter of Binary Tree
22%
EasyE
22%
TreeDepth-First Search+2
Solve→
Can Place Flowers
22%
EasyE
22%
ArrayGreedy
Solve→
Valid Palindrome II
22%
EasyE
22%
Two PointersString+1
Solve→
Similar String Groups
22%
HardH
22%
ArrayHash Table+4
Solve→
Maximize Distance to Closest Person
22%
MediumM
22%
Array
Solve→
Snakes and Ladders
22%
MediumM
22%
ArrayBreadth-First Search+1
Solve→
Verifying an Alien Dictionary
22%
EasyE
22%
ArrayHash Table+1
Solve→
Minimum Remove to Make Valid Parentheses
22%
MediumM
22%
StringStack
Solve→
Product of the Last K Numbers
22%
MediumM
22%
ArrayMath+3
Solve→
Dot Product of Two Sparse Vectors
22%
MediumM
22%
ArrayHash Table+3
Solve→
Determine if Two Strings Are Close
22%
MediumM
22%
Hash TableString+2
Solve→
Sum of Subarray Ranges
22%
MediumM
22%
ArrayStack+1
Solve→
First Letter to Appear Twice
22%
EasyE
22%
Hash TableString+2
Solve→
Shortest Distance from All Buildings
22%
HardH
22%
ArrayBreadth-First Search+1
Solve→
Web Crawler Multithreaded
22%
MediumM
22%
Depth-First SearchBreadth-First Search+1
Solve→
Max Chunks To Make Sorted
22%
MediumM
22%
ArrayStack+3
Solve→
String Compression III
22%
MediumM
22%
String
Solve→
Binary Tree Zigzag Level Order Traversal
22%
MediumM
22%
TreeBreadth-First Search+1
Solve→
Split Strings by Separator
22%
EasyE
22%
ArrayString
Solve→
Goat Latin
22%
EasyE
22%
String
Solve→
Guess the Word
22%
HardH
22%
ArrayMath+4
Solve→
Sliding Window Median
22%
HardH
22%
ArrayHash Table+3
Solve→
Image Smoother
22%
EasyE
22%
ArrayMatrix
Solve→
Clone Graph
22%
MediumM
22%
Hash TableDepth-First Search+2
Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial
Walking Robot Simulation
22%
MediumM
22%
ArrayHash Table+1
Solve→
Intersection of Three Sorted Arrays
22%
EasyE
22%
ArrayHash Table+2
Solve→
Read N Characters Given Read4
22%
EasyE
22%
ArraySimulation+1
Solve→
Optimize Water Distribution in a Village
22%
HardH
22%
Union-FindGraph Theory+5
Solve→
Longest Common Subsequence
22%
MediumM
22%
StringDynamic Programming+1
Solve→
Minimize Maximum Component Cost
22%
MediumM
22%
Binary SearchUnion-Find+2
Solve→
Substring with Concatenation of All Words
22%
HardH
22%
Hash TableString+1
Solve→
Binary Search Tree Iterator
22%
MediumM
22%
StackTree+4
Solve→
Minimum Speed to Arrive on Time
22%
MediumM
22%
ArrayBinary Search
Solve→
Convert Sorted List to Binary Search Tree
22%
MediumM
22%
Linked ListDivide and Conquer+3
Solve→
Maximum Population Year
22%
EasyE
22%
ArrayCounting+1
Solve→
Counting Bits
22%
EasyE
22%
Dynamic ProgrammingBit Manipulation
Solve→
Sentence Similarity II
22%
MediumM
22%
ArrayHash Table+4
Solve→
Design Linked List
22%
MediumM
22%
Linked ListDesign
Solve→
Encode and Decode TinyURL
22%
MediumM
22%
Hash TableString+2
Solve→
Water and Jug Problem
22%
MediumM
22%
MathDepth-First Search+5
Solve→
Minimum Size Subarray Sum
22%
MediumM
22%
ArrayBinary Search+2
Solve→
Non-overlapping Intervals
22%
MediumM
22%
ArrayDynamic Programming+2
Solve→
The Maze
22%
MediumM
22%
ArrayDepth-First Search+2
Solve→
Number of Recent Calls
22%
EasyE
22%
DesignQueue+1
Solve→
Evaluate Division
22%
MediumM
22%
ArrayString+7
Solve→
Assign Cookies
22%
EasyE
22%
ArrayTwo Pointers+3
Solve→
Meeting Scheduler
22%
MediumM
22%
ArrayTwo Pointers+1
Solve→
Max Area of Island
22%
MediumM
22%
ArrayDepth-First Search+3
Solve→
One Edit Distance
22%
MediumM
22%
Two PointersString
Solve→

Pass your interview with AI assistance

Get real-time solutions during your actual coding interview. Invisible to screensharing.

Start Free Trial
Exclusive Time of Functions
22%
MediumM
22%
ArrayStack
Solve→
Minimum Falling Path Sum
22%
MediumM
22%
ArrayDynamic Programming+1
Solve→
Permutation in String
22%
MediumM
22%
Hash TableTwo Pointers+2
Solve→
Maximum Sum Circular Subarray
22%
MediumM
22%
ArrayDivide and Conquer+3
Solve→
Remove Duplicates from Sorted List II
22%
MediumM
22%
Linked ListTwo Pointers
Solve→
Construct Binary Tree from Preorder and Postorder Traversal
22%
MediumM
22%
ArrayHash Table+3
Solve→
Convert Object to JSON String
22%
MediumM
22%
Solve→
Moving Average from Data Stream
22%
EasyE
22%
ArrayDesign+2
Solve→
All Nodes Distance K in Binary Tree
22%
MediumM
22%
Hash TableTree+3
Solve→
All O`one Data Structure
22%
HardH
22%
Hash TableLinked List+2
Solve→
Longest Happy Prefix
22%
HardH
22%
StringRolling Hash+4
Solve→
Balanced Binary Tree
22%
EasyE
22%
TreeDepth-First Search+1
Solve→
Find Distance in a Binary Tree
22%
MediumM
22%
Hash TableTree+5
Solve→
Koko Eating Bananas
22%
MediumM
22%
ArrayBinary Search
Solve→
Next Greater Element I
22%
EasyE
22%
ArrayHash Table+2
Solve→
My Calendar I
22%
MediumM
22%
ArrayBinary Search+3
Solve→
Binary Search
22%
EasyE
22%
ArrayBinary Search
Solve→
Basic Calculator III
22%
HardH
22%
MathString+2
Solve→
Redundant Connection
22%
MediumM
22%
Depth-First SearchBreadth-First Search+2
Solve→
Pacific Atlantic Water Flow
22%
MediumM
22%
ArrayDepth-First Search+2
Solve→
Partition Equal Subset Sum
22%
MediumM
22%
ArrayDynamic Programming+2
Solve→
Building H2O
22%
MediumM
22%
Concurrency
Solve→
Spiral Matrix II
22%
MediumM
22%
ArrayMatrix+1
Solve→

Similar Companies

Explore company practice sets with a similar number of tagged coding questions.

Oracle
299 problems
Goldman Sachs
264 problems
TCS
253 problems
TikTok
348 problems
Uber
359 problems
Infosys
221 problems

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 Free

No credit card required

All CompaniesEasy ProblemsMedium ProblemsHard ProblemsBrowse by Topic
Interview Solver
  • Home
  • About
  • Pricing
  • Sign in
  • Contact
  • Blog
  • Companion
  • Help Center
  • Developers
  • Use Cases
  • Software Engineer
  • Product Manager
  • Misc
  • Privacy Policy
  • Terms and Conditions
  • Refund & Cancellation
  • Discord Community
  • Affiliate Program
  • Compare
  • All Comparisons
  • vs Final Round AI
  • vs UltraCode
  • vs Interview Coder
  • vs LockedIn AI
  • vs AI Apply
  • Free Tools
  • ATS Resume Checker
  • STAR Method Builder
  • Salary Lookup
  • Big O Cheat Sheet
  • Total Comp Calculator
  • View All →
  • Interview Questions
  • Google Questions
  • Amazon Questions
  • Microsoft Questions
  • Meta Questions
  • Apple Questions
  • TikTok Questions
  • View All →
© 2026 Interview Solver, Inc. All rights reserved.