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
- Most Common WordeasyArrayHash TableStringCountingfrequency 11.4
- Move Pieces to Obtain a StringmediumTwo PointersStringfrequency 11.4
- My Calendar ImediumArrayBinary SearchDesignSegment Tree+1frequency 11.4
- Nested List Weight Sum IImediumStackDepth-First SearchBreadth-First Searchfrequency 11.4
- Network Delay TimemediumDepth-First SearchBreadth-First SearchGraph TheoryHeap (Priority Queue)+2frequency 11.4
- Nth Highest SalarymediumDatabasefrequency 11.4
- Number of Common FactorseasyMathEnumerationNumber TheoryEuclidean Algorithm+1frequency 11.4
- Number of Connected Components in an Undirected GraphmediumDepth-First SearchBreadth-First SearchUnion-FindGraph Theoryfrequency 11.4
- Number of Digit OnehardMathDynamic ProgrammingRecursionfrequency 11.4
- Number of Steps to Reduce a Number in Binary Representation to OnemediumStringBit ManipulationSimulationfrequency 11.4
- Number of Steps to Reduce a Number to ZeroeasyMathBit Manipulationfrequency 11.4
- Partition to K Equal Sum SubsetsmediumArrayDynamic ProgrammingBacktrackingBit Manipulation+2frequency 11.4
- Pascal's Triangle IIeasyArrayDynamic Programmingfrequency 11.4
- Patching ArrayhardArrayGreedyfrequency 11.4
- Perfect SquaresmediumMathDynamic ProgrammingBreadth-First SearchKnapsack Problem+1frequency 11.4
- Possible BipartitionmediumDepth-First SearchBreadth-First SearchUnion-FindGraph Theory+2frequency 11.4
- Power Grid MaintenancemediumArrayHash TableDepth-First SearchBreadth-First Search+4frequency 11.4
- Predict the WinnermediumArrayMathDynamic ProgrammingRecursion+3frequency 11.4
- Primary Department for Each EmployeeeasyDatabasefrequency 11.4
- Push DominoesmediumTwo PointersStringDynamic Programmingfrequency 11.4
- Queue Reconstruction by HeightmediumArrayBinary Indexed TreeSegment TreeSortingfrequency 11.4
- Rank Transform of a MatrixhardArrayUnion-FindGraph TheoryTopological Sort+2frequency 11.4
- Reconstruct ItineraryhardArrayStringDepth-First SearchGraph Theory+5frequency 11.4
- Remove All Occurrences of a SubstringmediumStringStackSimulationfrequency 11.4
- Remove Nodes From Linked ListmediumLinked ListStackRecursionMonotonic Stackfrequency 11.4
- Restaurant GrowthmediumDatabasefrequency 11.4
- Restore the Array From Adjacent PairsmediumArrayHash TableDepth-First Searchfrequency 11.4
- Second Minimum Node In a Binary TreeeasyTreeDepth-First SearchBinary Treefrequency 11.4
- Separate Squares ImediumArrayBinary Searchfrequency 11.4
- Shortest Subarray With OR at Least K IImediumArrayBit ManipulationSliding Windowfrequency 11.4
- Sliding PuzzlehardArrayDynamic ProgrammingBacktrackingBreadth-First Search+5frequency 11.4
- Smallest Palindromic Rearrangement ImediumStringSortingCounting Sortfrequency 11.4
- Smallest Range Covering Elements from K ListshardArrayHash TableGreedySliding Window+2frequency 11.4
- Split a String in Balanced StringseasyStringGreedyCountingfrequency 11.4
- Stone Game IImediumArrayMathDynamic ProgrammingMinimax+3frequency 11.4
- Subarrays with K Different IntegershardArrayHash TableSliding WindowCountingfrequency 11.4
- Sum of Root To Leaf Binary NumberseasyTreeDepth-First SearchBinary Treefrequency 11.4
- Swapping Nodes in a Linked ListmediumLinked ListTwo Pointersfrequency 11.4
- Trionic Array IIhardArrayDynamic Programmingfrequency 11.4
- Two City SchedulingmediumArrayGreedySortingHungarian Algorithm+1frequency 11.4
- UTF-8 ValidationmediumArrayBit Manipulationfrequency 11.4
- Ugly Number IImediumHash TableMathDynamic ProgrammingHeap (Priority Queue)frequency 11.4
- Unpopular BooksmediumDatabasefrequency 11.4
- Valid Phone NumberseasyShellfrequency 11.4
- Water BottleseasyMathSimulationfrequency 11.4
- Zero Array Transformation IIImediumArrayTwo PointersGreedySorting+2frequency 11.4
- 2 Keys KeyboardmediumMathDynamic Programmingfrequency 8.0
- All Paths From Source to TargetmediumBacktrackingDepth-First SearchBreadth-First SearchGraph Theory+1frequency 8.0
- Apply Operations to an ArrayeasyArrayTwo PointersSimulationfrequency 8.0
- Apply Transform Over Each Element in Arrayeasyfrequency 8.0