Meta
Fast-paced coding rounds — two problems in 45 minutes is common — plus a product-minded design round and a dedicated behavioral round.
Typical loop
- 1Recruiter screen
- 2Phone screen: 1-2 coding problems
- 3Onsite: two coding rounds
- 4System or product design round
- 5Behavioral round
Questions
Callback's practice questions and the LeetCode questions Meta has been asking, filtered together.
Asked on LeetCode
1,399 questions · all time
- Distribute Candies Among Children IImediumMathCombinatoricsEnumerationfrequency 14.4
- Divisible and Non-divisible Sums DifferenceeasyMathfrequency 14.4
- Domino and Tromino TilingmediumDynamic Programmingfrequency 14.4
- Dungeon GamehardArrayDynamic ProgrammingMatrixfrequency 14.4
- Exchange SeatsmediumDatabasefrequency 14.4
- Find Books with No Available CopieseasyDatabasefrequency 14.4
- Find Most Frequent Vowel and ConsonanteasyHash TableStringCountingfrequency 14.4
- Find Smallest Letter Greater Than TargeteasyArrayBinary Searchfrequency 14.4
- Find Words Containing CharactereasyArrayStringfrequency 14.4
- Find the Count of Good IntegershardHash TableMathCombinatoricsEnumerationfrequency 14.4
- Find the DifferenceeasyHash TableStringBit ManipulationSortingfrequency 14.4
- Find the Maximum Sum of Node ValueshardArrayDynamic ProgrammingGreedyBit Manipulation+2frequency 14.4
- Fix Names in a TableeasyDatabasefrequency 14.4
- Flatten a Multilevel Doubly Linked ListmediumLinked ListDepth-First SearchDoubly-Linked Listfrequency 14.4
- Game Play Analysis IeasyDatabasefrequency 14.4
- Hand of StraightsmediumArrayHash TableGreedySortingfrequency 14.4
- How Many Numbers Are Smaller Than the Current NumbereasyArrayHash TableSortingCounting Sortfrequency 14.4
- Island PerimetereasyArrayDepth-First SearchBreadth-First SearchMatrixfrequency 14.4
- LFU CachehardHash TableLinked ListDesignDoubly-Linked Listfrequency 14.4
- Last Stone WeighteasyArrayHeap (Priority Queue)frequency 14.4
- Leaf-Similar TreeseasyTreeDepth-First SearchBinary Treefrequency 14.4
- Letter Tile PossibilitiesmediumHash TableStringBacktrackingCountingfrequency 14.4
- Make Sum Divisible by PmediumArrayHash TablePrefix Sumfrequency 14.4
- Maximize Active Section with Trade ImediumStringEnumerationfrequency 14.4
- Maximum Candies Allocated to K ChildrenmediumArrayBinary Searchfrequency 14.4
- Maximum Difference Between Increasing ElementseasyArrayfrequency 14.4
- Maximum GapmediumArraySortingBucket SortRadix Sort+1frequency 14.4
- Maximum Number of Operations to Move Ones to the EndmediumStringGreedyCountingfrequency 14.4
- Maximum Population YeareasyArrayCountingPrefix Sumfrequency 14.4
- Maximum Product of Splitted Binary TreemediumTreeDepth-First SearchBinary Treefrequency 14.4
- Maximum Product of Two Elements in an ArrayeasyArraySortingHeap (Priority Queue)frequency 14.4
- Maximum Profit in Job SchedulinghardArrayBinary SearchDynamic ProgrammingSortingfrequency 14.4
- Maximum Sum BST in Binary TreehardDynamic ProgrammingTreeDepth-First SearchBinary Search Tree+2frequency 14.4
- Merge Two 2D Arrays by Summing ValueseasyArrayHash TableTwo Pointersfrequency 14.4
- Mini ParsermediumStringStackDepth-First Searchfrequency 14.4
- Minimum Distance Between BST NodeseasyTreeDepth-First SearchBreadth-First SearchBinary Search Tree+1frequency 14.4
- Nim GameeasyMathBrainteaserMinimaxGame Theory+2frequency 14.4
- Number of Closed IslandsmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 14.4
- Number of Islands IIhardArrayHash TableUnion-Findfrequency 14.4
- Number of Matching SubsequencesmediumArrayHash TableStringBinary Search+3frequency 14.4
- Number of Strings That Appear as Substrings in WordeasyArrayStringfrequency 14.4
- Number of Ways to Form a Target String Given a DictionaryhardArrayStringDynamic Programmingfrequency 14.4
- Number of Zero-Filled SubarraysmediumArrayMathfrequency 14.4
- Partition Array Into Two Arrays to Minimize Sum DifferencehardArrayTwo PointersBinary SearchDynamic Programming+5frequency 14.4
- Permutation SequencehardMathRecursionfrequency 14.4
- Power of FoureasyMathBit ManipulationRecursionfrequency 14.4
- Product Sales Analysis IeasyDatabasefrequency 14.4
- Put Marbles in BagshardArrayGreedySortingHeap (Priority Queue)frequency 14.4
- Recover Binary Search TreemediumTreeDepth-First SearchBinary Search TreeBinary Treefrequency 14.4
- Reorder Routes to Make All Paths Lead to the City ZeromediumDepth-First SearchBreadth-First SearchGraph Theoryfrequency 14.4