← Back to Interview Questions

Meta LeetCode Problems

100 most frequently asked LeetCode problems in Meta technical interviews

Difficulty breakdown: 26 Easy, 60 Medium, 14 Hard

Ace Your Meta Interview

Don't just study these problems — get real-time AI assistance during your actual interview with Interview Solver.

Try Free
ProblemDiff
Minimum Remove to Make Valid Parentheses
100%
M
→
Binary Tree Vertical Order Traversal
97%
M
→
Basic Calculator II
96%
M
→
Valid Palindrome II
95%
E
→
Merge Sorted Array
92%
E
→
Kth Largest Element in an Array
92%
M
→
Lowest Common Ancestor of a Binary Tree III
91%
M
→
Valid Word Abbreviation
87%
E
→
Random Pick with Weight
87%
M
→
Pow(x, n)
85%
M
→
Find Peak Element
85%
M
→
Nested List Weight Sum
84%
M
→
Subarray Sum Equals K
81%
M
→
Lowest Common Ancestor of a Binary Tree
79%
M
→
Valid Palindrome
78%
E
→
Two Sum
76%
E
→
Binary Tree Right Side View
76%
M
→
Top K Frequent Elements
76%
M
→
Dot Product of Two Sparse Vectors
76%
M
→
Diameter of Binary Tree
74%
E
→
Simplify Path
73%
M
→
Range Sum of BST
73%
E
→
Merge k Sorted Lists
72%
H
→
Merge Intervals
72%
M
→
Valid Number
69%
H
→
Interval List Intersections
69%
M
→
Shortest Path in Binary Matrix
69%
M
→
Sum Root to Leaf Numbers
68%
M
→
K Closest Points to Origin
68%
M
→
Copy List with Random Pointer
66%
M
→
LRU Cache
66%
M
→
Minimum Add to Make Parentheses Valid
66%
M
→
Subsets
64%
M
→
Convert Binary Search Tree to Sorted Doubly Linked List
64%
M
→
All Nodes Distance K in Binary Tree
64%
M
→
Buildings With an Ocean View
64%
M
→
Next Permutation
62%
M
→
Closest Binary Search Tree Value
62%
E
→
Moving Average from Data Stream
62%
E
→
Accounts Merge
62%
M
→
Valid Palindrome III
62%
H
→
Create Hello World Function
62%
E
→
Add Two Numbers
60%
M
→
Minimum Window Substring
60%
H
→
Clone Graph
60%
M
→
Custom Sort String
60%
M
→
Making A Large Island
60%
H
→
Vertical Order Traversal of a Binary Tree
60%
H
→
Word Break
57%
M
→
Insert into a Sorted Circular Linked List
57%
M
→
Check Completeness of a Binary Tree
57%
M
→
Max Consecutive Ones III
57%
M
→
Kth Missing Positive Number
57%
E
→
Recyclable and Low Fat Products
57%
E
→
Find First and Last Position of Element in Sorted Array
54%
M
→
Add Strings
54%
E
→
Merge Strings Alternately
54%
E
→
Longest Common Prefix
51%
E
→
Populating Next Right Pointers in Each Node
51%
M
→
Best Time to Buy and Sell Stock
51%
E
→
Majority Element
51%
E
→
Binary Search Tree Iterator
51%
M
→
Longest Increasing Path in a Matrix
51%
H
→
Random Pick Index
51%
M
→
Can Place Flowers
51%
E
→
Rotate Image
47%
M
→
Boundary of Binary Tree
47%
M
→
Median of Two Sorted Arrays
43%
H
→
Longest Palindromic Substring
43%
M
→
Remove Nth Node From End of List
43%
M
→
Valid Parentheses
43%
E
→
Same Tree
43%
E
→
Word Ladder
43%
H
→
Course Schedule
43%
M
→
Group Shifted Strings
43%
M
→
Alien Dictionary
43%
H
→
Maximum Size Subarray Sum Equals k
43%
M
→
Diagonal Traverse
43%
M
→
Continuous Subarray Sum
43%
M
→
Palindromic Substrings
43%
M
→
Maximum Swap
43%
M
→
Toeplitz Matrix
43%
E
→
Goat Latin
43%
E
→
Longest Substring Without Repeating Characters
37%
M
→
3Sum
37%
M
→
Search Insert Position
37%
E
→
Unique Paths
37%
M
→
Convert Sorted List to Binary Search Tree
37%
M
→
Binary Tree Maximum Path Sum
37%
H
→
Missing Ranges
37%
E
→
Kth Smallest Element in a BST
37%
M
→
Palindrome Linked List
37%
E
→
Sliding Window Maximum
37%
H
→
Expression Add Operators
37%
H
→
Find Median from Data Stream
37%
H
→
Kth Smallest Element in a Sorted Matrix
37%
M
→
Insert Delete GetRandom O(1)
37%
M
→
Asteroid Collision
37%
M
→
Friends Of Appropriate Ages
37%
M
→
Squares of a Sorted Array
37%
E
→