13 Meta interview problems, solved step by step.
Meta’s coding rounds are known for two pointers, trees and arrays, often two problems in one round. These are the classic problems that practise that. No company publishes its questions; this is the practice set candidates commonly use. Each one is solved in 22 languages from brute force to optimal, with code you can run on the page.
0/13 solved
- Two SumEasy
- Valid PalindromeEasy
- Valid ParenthesesEasy
- Merge Two Sorted ListsEasy
- Maximum Depth of a Binary TreeEasy
- 3SumMedium
- Container With Most WaterMedium
- Merge IntervalsMedium
- Product of Array Except SelfMedium
- Binary Tree Level Order TraversalMedium
- Kth Largest Element in an ArrayMedium
- Top K Frequent ElementsMedium
- Number of IslandsMedium