Meta

Typical loop

1. 1Recruiter screen
2. 2Phone screen: 1-2 coding problems
3. 3Onsite: two coding rounds
4. 4System or product design round
5. 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

• Number of Changing KeyseasyStringfrequency 5.0
• Number of Days Between Two DateseasyMathStringfrequency 5.0
• Number of Different Subsequences GCDshardArrayMathCountingNumber Theory+2frequency 5.0
• Number of EnclavesmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 5.0
• Number of Even and Odd BitseasyBit Manipulationfrequency 5.0
• Number of Laser Beams in a BankmediumArrayMathStringMatrixfrequency 5.0
• Number of Pairs Satisfying InequalityhardArrayBinary SearchDivide and ConquerBinary Indexed Tree+3frequency 5.0
• Number of Unique XOR Triplets ImediumArrayMathBit Manipulationfrequency 5.0
• Number of Ways to Paint N × 3 GridhardDynamic ProgrammingGraph Coloringfrequency 5.0
• Number of ZigZag Arrays IhardDynamic ProgrammingPrefix Sumfrequency 5.0
• Paint FencemediumDynamic Programmingfrequency 5.0
• Palindrome PairshardArrayHash TableStringTrie+1frequency 5.0
• Parallel CoursesmediumGraph TheoryTopological SortDirected Acyclic Graphfrequency 5.0
• Partition Array According to Given PivotmediumArrayTwo PointersSimulationfrequency 5.0
• Partition Array into Two Equal Product SubsetsmediumArrayBit ManipulationRecursionEnumerationfrequency 5.0
• Path Existence Queries in a Graph IIhardArrayTwo PointersBinary SearchDynamic Programming+4frequency 5.0
• Path with Maximum ProbabilitymediumArrayGraph TheoryHeap (Priority Queue)Shortest Path+1frequency 5.0
• Patients With a ConditioneasyDatabasefrequency 5.0
• Perfect RectanglehardArrayHash TableMathGeometry+1frequency 5.0
• Prime PalindromemediumMathNumber TheoryPrimality Testfrequency 5.0
• Prime Subtraction OperationmediumArrayMathBinary SearchGreedy+1frequency 5.0
• Print Binary TreemediumTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 5.0
• Process String with Special Operations IIhardStringSimulationfrequency 5.0
• Range ModulehardDesignSegment TreeOrdered Setfrequency 5.0
• Reach End of Array With Max ScoremediumArrayGreedyfrequency 5.0
• Reach a NumbermediumMathBinary Searchfrequency 5.0
• Rearrange Products TableeasyDatabasefrequency 5.0
• Rearranging FruitshardArrayHash TableGreedySortfrequency 5.0
• Rectangle AreamediumMathGeometryfrequency 5.0
• Reformat Department TableeasyDatabasefrequency 5.0
• Remove BoxeshardArrayDynamic ProgrammingMemoizationfrequency 5.0
• Remove CommentsmediumArrayStringfrequency 5.0
• Remove Covered IntervalsmediumArraySortingfrequency 5.0
• Remove Digit From Number to Maximize ResulteasyStringGreedyEnumerationfrequency 5.0
• Remove Max Number of Edges to Keep Graph Fully TraversablehardUnion-FindGraph Theoryfrequency 5.0
• Reorder Data in Log FilesmediumArrayStringSortingfrequency 5.0
• Reordered Power of 2mediumHash TableMathSortingCounting+1frequency 5.0
• Reschedule Meetings for Maximum Free Time ImediumArrayGreedySliding Windowfrequency 5.0
• Reshape Data: Pivoteasyfrequency 5.0
• Restore Finishing OrdereasyArrayHash Tablefrequency 5.0
• Reverse Nodes in Even Length GroupsmediumLinked Listfrequency 5.0
• Robot CollisionshardArrayStackSortingSimulationfrequency 5.0
• Rotate FunctionmediumArrayMathDynamic Programmingfrequency 5.0
• Satisfiability of Equality EquationsmediumArrayStringUnion-FindGraph Theoryfrequency 5.0
• Seat Reservation ManagermediumDesignHeap (Priority Queue)frequency 5.0
• Second Largest Digit in a StringeasyHash TableStringfrequency 5.0
• Self Dividing NumberseasyMathfrequency 5.0
• Set Intersection Size At Least TwohardArrayGreedySortingfrequency 5.0
• Shortest Distance in a PlanemediumDatabaseNearest Pair of Pointsfrequency 5.0
• Shortest Subarray to be Removed to Make Array SortedmediumArrayTwo PointersBinary SearchStack+1frequency 5.0