Meta LeetCode Interview Questions
Practice 100 real coding problems frequently asked in Meta technical interviews. Master these questions to ace your next Meta software engineering interview.
Top Topics at Meta
Ace your Meta interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Meta Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Minimum Remove to Make Valid Parentheses 100% | MediumM | Solve→ |
Binary Tree Vertical Order Traversal 97% | MediumM | Solve→ |
Basic Calculator II 96% | MediumM | Solve→ |
Valid Palindrome II 95% | EasyE | Solve→ |
Merge Sorted Array 92% | EasyE | Solve→ |
Kth Largest Element in an Array 92% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Tree III 91% | MediumM | Solve→ |
Valid Word Abbreviation 87% | EasyE | Solve→ |
Random Pick with Weight 87% | MediumM | Solve→ |
Pow(x, n) 85% | MediumM | Solve→ |
Find Peak Element 85% | MediumM | Solve→ |
Nested List Weight Sum 84% | MediumM | Solve→ |
Subarray Sum Equals K 81% | MediumM | Solve→ |
Lowest Common Ancestor of a Binary Tree 79% | MediumM | Solve→ |
Valid Palindrome 78% | EasyE | Solve→ |
Two Sum 76% | EasyE | Solve→ |
Binary Tree Right Side View 76% | MediumM | Solve→ |
Top K Frequent Elements 76% | MediumM | Solve→ |
Dot Product of Two Sparse Vectors 76% | MediumM | Solve→ |
Diameter of Binary Tree 74% | EasyE | Solve→ |
Simplify Path 73% | MediumM | Solve→ |
Range Sum of BST 73% | EasyE | Solve→ |
Merge k Sorted Lists 72% | HardH | Solve→ |
Merge Intervals 72% | MediumM | Solve→ |
Valid Number 69% | HardH | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Interval List Intersections 69% | MediumM | Solve→ |
Shortest Path in Binary Matrix 69% | MediumM | Solve→ |
Sum Root to Leaf Numbers 68% | MediumM | Solve→ |
K Closest Points to Origin 68% | MediumM | Solve→ |
Copy List with Random Pointer 66% | MediumM | Solve→ |
LRU Cache 66% | MediumM | Solve→ |
Minimum Add to Make Parentheses Valid 66% | MediumM | Solve→ |
Subsets 64% | MediumM | Solve→ |
Convert Binary Search Tree to Sorted Doubly Linked List 64% | MediumM | Solve→ |
All Nodes Distance K in Binary Tree 64% | MediumM | Solve→ |
Buildings With an Ocean View 64% | MediumM | Solve→ |
Next Permutation 62% | MediumM | Solve→ |
Closest Binary Search Tree Value 62% | EasyE | Solve→ |
Moving Average from Data Stream 62% | EasyE | Solve→ |
Accounts Merge 62% | MediumM | Solve→ |
Valid Palindrome III 62% | HardH | Solve→ |
Create Hello World Function 62% | EasyE | Solve→ |
Add Two Numbers 60% | MediumM | Solve→ |
Minimum Window Substring 60% | HardH | Solve→ |
Clone Graph 60% | MediumM | Solve→ |
Custom Sort String 60% | MediumM | Solve→ |
Making A Large Island 60% | HardH | Solve→ |
Vertical Order Traversal of a Binary Tree 60% | HardH | Solve→ |
Word Break 57% | MediumM | Solve→ |
Insert into a Sorted Circular Linked List 57% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Check Completeness of a Binary Tree 57% | MediumM | Solve→ |
Max Consecutive Ones III 57% | MediumM | Solve→ |
Kth Missing Positive Number 57% | EasyE | Solve→ |
Recyclable and Low Fat Products 57% | EasyE | Solve→ |
Find First and Last Position of Element in Sorted Array 54% | MediumM | Solve→ |
Add Strings 54% | EasyE | Solve→ |
Merge Strings Alternately 54% | EasyE | Solve→ |
Longest Common Prefix 51% | EasyE | Solve→ |
Populating Next Right Pointers in Each Node 51% | MediumM | Solve→ |
Best Time to Buy and Sell Stock 51% | EasyE | Solve→ |
Majority Element 51% | EasyE | Solve→ |
Binary Search Tree Iterator 51% | MediumM | Solve→ |
Longest Increasing Path in a Matrix 51% | HardH | Solve→ |
Random Pick Index 51% | MediumM | Solve→ |
Can Place Flowers 51% | EasyE | Solve→ |
Rotate Image 47% | MediumM | Solve→ |
Boundary of Binary Tree 47% | MediumM | Solve→ |
Median of Two Sorted Arrays 43% | HardH | Solve→ |
Longest Palindromic Substring 43% | MediumM | Solve→ |
Remove Nth Node From End of List 43% | MediumM | Solve→ |
Valid Parentheses 43% | EasyE | Solve→ |
Same Tree 43% | EasyE | Solve→ |
Word Ladder 43% | HardH | Solve→ |
Course Schedule 43% | MediumM | Solve→ |
Group Shifted Strings 43% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Alien Dictionary 43% | HardH | Solve→ |
Maximum Size Subarray Sum Equals k 43% | MediumM | Solve→ |
Diagonal Traverse 43% | MediumM | Solve→ |
Continuous Subarray Sum 43% | MediumM | Solve→ |
Palindromic Substrings 43% | MediumM | Solve→ |
Maximum Swap 43% | MediumM | Solve→ |
Toeplitz Matrix 43% | EasyE | Solve→ |
Goat Latin 43% | EasyE | Solve→ |
Longest Substring Without Repeating Characters 37% | MediumM | Solve→ |
3Sum 37% | MediumM | Solve→ |
Search Insert Position 37% | EasyE | Solve→ |
Unique Paths 37% | MediumM | Solve→ |
Convert Sorted List to Binary Search Tree 37% | MediumM | Solve→ |
Binary Tree Maximum Path Sum 37% | HardH | Solve→ |
Missing Ranges 37% | EasyE | Solve→ |
Kth Smallest Element in a BST 37% | MediumM | Solve→ |
Palindrome Linked List 37% | EasyE | Solve→ |
Sliding Window Maximum 37% | HardH | Solve→ |
Expression Add Operators 37% | HardH | Solve→ |
Find Median from Data Stream 37% | HardH | Solve→ |
Kth Smallest Element in a Sorted Matrix 37% | MediumM | Solve→ |
Insert Delete GetRandom O(1) 37% | MediumM | Solve→ |
Asteroid Collision 37% | MediumM | Solve→ |
Friends Of Appropriate Ages 37% | MediumM | Solve→ |
Squares of a Sorted Array 37% | EasyE | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Meta ask in interviews?
Meta commonly asks 100 coding problems in technical interviews, including Minimum Remove to Make Valid Parentheses, Binary Tree Vertical Order Traversal, Basic Calculator II. The difficulty breakdown is 26 Easy, 60 Medium, and 14 Hard problems.
How should I prepare for a Meta coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Meta interviews typically emphasize Array and String. Practice explaining your thought process while coding.
What is the difficulty level of Meta coding interviews?
Based on our data, Meta interviews include 26 Easy (26%), 60 Medium (60%), and 14 Hard (14%) problems.
Ready to ace your Meta interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required