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
- Detect Cycles in 2D GridmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 5.0
- Distinct Prime Factors of Product of ArraymediumArrayHash TableMathNumber Theory+6frequency 5.0
- Distribute Coins in Binary TreemediumTreeDepth-First SearchBinary TreeDP on Treesfrequency 5.0
- Divide Array Into Arrays With Max DifferencemediumArrayGreedySortingfrequency 5.0
- Divide Array Into Equal PairseasyArrayHash TableBit ManipulationCountingfrequency 5.0
- Divide an Array Into Subarrays With Minimum Cost IeasyArraySortingEnumerationfrequency 5.0
- Earliest Finish Time for Land and Water Rides IeasyArrayTwo PointersBinary SearchGreedy+1frequency 5.0
- Eliminate Maximum Number of MonstersmediumArrayGreedySortingfrequency 5.0
- Employee Free TimehardArraySweep LineSortingHeap (Priority Queue)frequency 5.0
- Final Array State After K Multiplication Operations IIhardArrayHeap (Priority Queue)Simulationfrequency 5.0
- Find All Possible Stable Binary Arrays ImediumDynamic ProgrammingPrefix Sumfrequency 5.0
- Find Champion IImediumGraph Theoryfrequency 5.0
- Find Closest PersoneasyMathfrequency 5.0
- Find Critical and Pseudo-Critical Edges in Minimum Spanning TreehardUnion-FindGraph TheorySortingMinimum Spanning Tree+4frequency 5.0
- Find Duplicate SubtreesmediumHash TableTreeDepth-First SearchBinary Treefrequency 5.0
- Find Maximal Uncovered RangesmediumArraySortingfrequency 5.0
- Find Minimum Time to Reach Last Room ImediumArrayGraph TheoryHeap (Priority Queue)Matrix+1frequency 5.0
- Find Missing ObservationsmediumArrayMathSimulationfrequency 5.0
- Find N Unique Integers Sum up to ZeroeasyArrayMathfrequency 5.0
- Find Original Array From Doubled ArraymediumArrayHash TableGreedySortingfrequency 5.0
- Find Sum of Array Product of Magical SequenceshardArrayMathDynamic ProgrammingBit Manipulation+2frequency 5.0
- Find Target Indices After Sorting ArrayeasyArrayBinary SearchSortingfrequency 5.0
- Find a Safe Walk Through a GridmediumArrayBreadth-First SearchGraph TheoryHeap (Priority Queue)+2frequency 5.0
- Find the Kth Largest Integer in the ArraymediumArrayStringDivide and ConquerSorting+2frequency 5.0
- Find the Maximum Length of Valid Subsequence ImediumArrayDynamic Programmingfrequency 5.0
- Find the Maximum Length of Valid Subsequence IImediumArrayDynamic Programmingfrequency 5.0
- Find the Number of Ways to Place People ImediumArrayMathGeometrySorting+1frequency 5.0
- Find the Number of Ways to Place People IIhardArrayMathGeometrySorting+1frequency 5.0
- Find the Original Typed String IIhardStringDynamic ProgrammingPrefix Sumfrequency 5.0
- Find the Pivot IntegereasyMathPrefix Sumfrequency 5.0
- Find the Power of K-Size Subarrays ImediumArraySliding Windowfrequency 5.0
- Find the Punishment Number of an IntegermediumMathBacktrackingfrequency 5.0
- Find the Town JudgeeasyArrayHash TableGraph Theoryfrequency 5.0
- Find the Winner of the Circular GamemediumArrayMathRecursionQueue+1frequency 5.0
- Flip Square Submatrix VerticallyeasyArrayTwo PointersMatrixfrequency 5.0
- Flip String to Monotone IncreasingmediumStringDynamic Programmingfrequency 5.0
- Fraction Addition and SubtractionmediumMathStringSimulationEuclidean Algorithm+1frequency 5.0
- Frequency Balance Subarraymediumfrequency 5.0
- Function Compositioneasyfrequency 5.0
- Generate Random Point in a CirclemediumMathGeometryRejection SamplingRandomizedfrequency 5.0
- Grid Teleportation TraversalmediumArrayHash TableBreadth-First SearchMatrixfrequency 5.0
- Group the People Given the Group Size They Belong TomediumArrayHash TableGreedyfrequency 5.0
- HeatersmediumArrayTwo PointersBinary SearchSortingfrequency 5.0
- Height CheckereasyArraySortingCounting SortBubble Sortfrequency 5.0
- Height of Binary Tree After Subtree Removal QuerieshardArrayTreeDepth-First SearchBreadth-First Search+1frequency 5.0
- Increment Submatrices by OnemediumArrayMatrixPrefix Sumfrequency 5.0
- Insertion Sort ListmediumLinked ListSortingfrequency 5.0
- Integer ReplacementmediumDynamic ProgrammingGreedyBit ManipulationMemoizationfrequency 5.0
- Intersection of Multiple ArrayseasyArrayHash TableSortingCountingfrequency 5.0
- Inverse Coin ChangemediumArrayDynamic Programmingfrequency 5.0