Facebook Coding Interview Questions
100 problems · 13 Easy 77 Medium 10 Hard
Facebook problems
Meta runs a full process: two coding rounds with medium-to-hard problems, one system design, and one behavioral. The most-asked patterns are two pointers, BFS/DFS, and interval problems. Practice medium and hard problems under a strict 45-minute clock.
Sliding Window 4 problems
Two Pointers 8 problems
| 3Sum | Medium | ||
| Container With Most Water | Medium | ||
| Trapping Rain Water | Hard | ||
| Valid Palindrome | Easy | ||
| Move Zeroes | Easy | ||
| Sort Colors | Medium | ||
| Squares of a Sorted Array | Easy | ||
| Valid Palindrome II | Easy |
Binary Search 6 problems
| Binary Search | Easy | ||
| Search in Rotated Sorted Array | Medium | ||
| Koko Eating Bananas | Medium | ||
| Find Peak Element | Medium | ||
| Capacity to Ship Packages Within D Days | Medium | ||
| Split Array Largest Sum | Hard |
Prefix Sum 3 problems
| Subarray Sum Equals K | Medium | ||
| Product of Array Except Self | Medium | ||
| Contiguous Array | Medium |
Hash Map / Set 6 problems
| Two Sum | Easy | ||
| Group Anagrams | Medium | ||
| Top K Frequent Elements | Medium | ||
| Longest Consecutive Sequence | Medium | ||
| LRU Cache | Medium | ||
| Subarray Sum Divisible by K | Medium |
Stack 5 problems
| Valid Parentheses | Easy | ||
| Daily Temperatures | Medium | ||
| Remove K Digits | Medium | ||
| Basic Calculator II | Medium | ||
| Simplify Path | Medium |
Queue / BFS 5 problems
| Number of Islands | Medium | ||
| Binary Tree Level Order Traversal | Medium | ||
| Word Ladder | Hard | ||
| 01 Matrix | Medium | ||
| Walls and Gates | Medium |
Heap / Priority Queue 6 problems
| Kth Largest Element in an Array | Medium | ||
| Task Scheduler | Medium | ||
| Merge K Sorted Lists | Hard | ||
| K Closest Points to Origin | Medium | ||
| Reorganize String | Medium | ||
| Minimum Cost to Connect Sticks | Medium |
Linked List 5 problems
| Reverse Linked List | Easy | ||
| Reorder List | Medium | ||
| Copy List with Random Pointer | Medium | ||
| Palindrome Linked List | Easy | ||
| Reverse Nodes in k-Group | Hard |
Trees / DFS 9 problems
Graphs 5 problems
| Clone Graph | Medium | ||
| Pacific Atlantic Water Flow | Medium | ||
| Surrounded Regions | Medium | ||
| All Paths From Source to Target | Medium | ||
| Cheapest Flights Within K Stops | Medium |
Dynamic Programming 11 problems
| Word Break | Medium | ||
| Decode Ways | Medium | ||
| Partition Equal Subset Sum | Medium | ||
| Target Sum | Medium | ||
| Best Time to Buy and Sell Stock | Easy | ||
| Palindromic Substrings | Medium | ||
| Longest Palindromic Substring | Medium | ||
| Maximum Product Subarray | Medium | ||
| Minimum Path Sum | Medium | ||
| Regular Expression Matching | Hard | ||
| Interleaving String | Medium |
Greedy 4 problems
| Jump Game II | Medium | ||
| Non-overlapping Intervals | Medium | ||
| Meeting Rooms II | Medium | ||
| Queue Reconstruction by Height | Medium |
Backtracking 7 problems
| Subsets | Medium | ||
| Combination Sum | Medium | ||
| Word Search | Medium | ||
| Letter Combinations of a Phone Number | Medium | ||
| Generate Parentheses | Medium | ||
| Palindrome Partitioning | Medium | ||
| Subsets II | Medium |
Trie 3 problems
| Implement Trie (Prefix Tree) | Medium | ||
| Design Add and Search Words Data Structure | Medium | ||
| Replace Words | Medium |
Union Find 3 problems
| Accounts Merge | Medium | ||
| Number of Provinces | Medium | ||
| Most Stones Removed with Same Row or Column | Medium |
Monotonic Stack 1 problems
Topological Sort 2 problems
| Course Schedule | Medium | ||
| Course Schedule II | Medium |
Bit Manipulation 3 problems
| Counting Bits | Easy | ||
| Sum of Two Integers | Medium | ||
| Single Number II | Medium |
Intervals 3 problems
| Merge Intervals | Medium | ||
| Insert Interval | Medium | ||
| Meeting Rooms | Easy |
Matrix 1 problems
| Maximal Square | Medium |