Company sheets › Meta
Meta interview preparation
Company behind Facebook, Instagram and WhatsApp; interviews are fast-paced DSA. SDE and intern roles through campus drives, referrals and online applications; most of the process is DSA.
Meta hiring process
- Online assessment — Two or three coding problems of medium difficulty (sometimes with CS MCQs), usually on HackerRank, HackerEarth or Codility.
- DSA interviews (2–3) — Arrays, strings, trees, graphs, DP and heaps — explain your approach, write clean code, analyse time and space.
- CS fundamentals / design — OOP, operating systems, DBMS, networks; sometimes a small low-level design problem.
- Hiring manager / behavioural — Projects, teamwork, handling conflict and why you want to join.
The process changes from year to year — check the official notice for the exact pattern.
Interview topics
- DSA interview questions
- OOP interview questions
- Operating Systems interview questions
- DBMS interview questions
- Computer Networks interview questions
- System Design interview questions
Tips
- Meta interviews often expect two problems in 45 minutes — practise solving medium problems quickly and cleanly.
- Talk through a brute-force idea first, then optimise — interviewers grade your thinking, not only the final code.
- Make the standard patterns automatic: two pointers, sliding window, BFS/DFS, binary search on the answer, DP.
- Prepare 4–5 short stories (a hard bug, a conflict, a deadline, a failure) for the behavioural questions.
Meta DSA problems (49)
- Subarray Sum Equals K — Medium
- 3Sum Count — Medium
- Product of Array Except Self — Medium
- Count and Say — Medium
- String to Integer (atoi) — Medium
- Squares of a Sorted Array — Easy
- 3Sum Closest — Medium
- Max Consecutive Ones III — Medium
- Minimum Window Substring — Hard
- Kth Missing Positive Number — Easy
- Koko Eating Bananas — Medium
- Minimum in Rotated Sorted Array — Medium
- Search a 2D Matrix — Medium
- Letter Combinations of a Phone Number — Medium
- Subsets with Duplicates — Medium
- Combination Sum II — Medium
- Word Search — Medium
- Sort a Linked List — Medium
- Reverse Nodes in K-Group — Hard
- Valid Parentheses — Medium
- Daily Temperatures — Medium
- LRU Cache — Hard
- Kth Largest Element in an Array — Easy
- K Closest Points to Origin — Medium
- Top K Frequent Elements — Medium
- Merge K Sorted Arrays — Medium
- Task Scheduler — Medium
- Median of a Running Stream — Hard
- Level Order Traversal — Easy
- Diameter of a Binary Tree — Medium
- Lowest Common Ancestor in a BST — Medium
- Right Side View — Medium
- Zigzag Level Order Traversal — Medium
- Vertical Order Traversal — Medium
- Lowest Common Ancestor in a Binary Tree — Medium
- Two Sum in a BST — Medium
- Nodes at Distance K — Medium
- Binary Tree Maximum Path Sum — Hard
- Number of Islands — Medium
- Course Schedule — Medium
- Is Graph Bipartite — Medium
- Word Ladder — Hard
- Partition Equal Subset Sum — Medium
- Wildcard Matching — Hard
- Non-overlapping Intervals — Medium
- Insert Interval — Medium
- Valid Parenthesis String — Medium
- Divide Two Integers — Medium
- Power Set Using Bitmasks — Medium