Algorithm-heavy loops with a high bar for code quality and complexity analysis. Googleyness rounds probe collaboration and comfort with ambiguity.
Typical loop
- 1Recruiter screen
- 2Phone screen: one 45-minute coding interview
- 3Onsite: 3-4 coding rounds plus system design (level-dependent)
- 4Googleyness & leadership round
- 5Hiring committee review
Questions
Callback's practice questions and the LeetCode questions Google has been asking, filtered together.
Asked on LeetCode
2,344 questions · all time
- Count Subarrays With Fixed BoundshardArrayQueueSliding WindowMonotonic Queuefrequency 12.6
- Count Vowel Substrings of a StringeasyHash TableStringfrequency 12.6
- Count the Number of Ideal ArrayshardMathDynamic ProgrammingCombinatoricsNumber Theory+2frequency 12.6
- Cousins in Binary Tree IImediumHash TableTreeDepth-First SearchBreadth-First Search+1frequency 12.6
- Customer Placing the Largest Number of OrderseasyDatabasefrequency 12.6
- Customers Who Bought All ProductsmediumDatabasefrequency 12.6
- Design Excel Sum FormulahardArrayHash TableStringGraph Theory+3frequency 12.6
- Design File SystemmediumHash TableStringDesignTriefrequency 12.6
- Design In-Memory File SystemhardHash TableStringDesignTrie+1frequency 12.6
- Design Parking SystemeasyDesignSimulationCountingfrequency 12.6
- Divide Nodes Into the Maximum Number of GroupshardDepth-First SearchBreadth-First SearchUnion-FindGraph Theoryfrequency 12.6
- Find Center of Star GrapheasyGraph Theoryfrequency 12.6
- Find Largest Value in Each Tree RowmediumTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 12.6
- Find Lucky Integer in an ArrayeasyArrayHash TableCountingfrequency 12.6
- Find Resultant Array After Removing AnagramseasyArrayHash TableStringSortingfrequency 12.6
- Find Users With Valid E-MailseasyDatabasefrequency 12.6
- Find and Replace PatternmediumArrayHash TableStringfrequency 12.6
- Find the Count of Good IntegershardHash TableMathCombinatoricsEnumerationfrequency 12.6
- Find the Minimum and Maximum Number of Nodes Between Critical PointsmediumLinked Listfrequency 12.6
- Find the Number of Distinct Colors Among the BallsmediumArrayHash TableSimulationfrequency 12.6
- Find the Original Typed String IeasyStringfrequency 12.6
- First Completely Painted Row or ColumnmediumArrayHash TableMatrixfrequency 12.6
- Four DivisorsmediumArrayMathPrime FactorizationSieve Theoryfrequency 12.6
- Fraction Addition and SubtractionmediumMathStringSimulationEuclidean Algorithm+1frequency 12.6
- Get the Size of a DataFrameeasyfrequency 12.6
- Gray CodemediumMathBacktrackingBit Manipulationfrequency 12.6
- Group Sold Products By The DateeasyDatabasefrequency 12.6
- Identify the Largest Outlier in an ArraymediumArrayHash TableCountingEnumerationfrequency 12.6
- Jump Game VhardArrayDynamic ProgrammingSortingfrequency 12.6
- Keep Multiplying Found Values by TwoeasyArrayHash TableSortingSimulationfrequency 12.6
- Length of Longest Subarray With at Most K FrequencymediumArrayHash TableSliding Windowfrequency 12.6
- Long Pressed NameeasyTwo PointersStringfrequency 12.6
- Longest Palindrome by Concatenating Two Letter WordsmediumArrayHash TableStringGreedy+1frequency 12.6
- Longest Subsequence Repeated k TimeshardHash TableTwo PointersStringBacktracking+2frequency 12.6
- Max Dot Product of Two SubsequenceshardArrayDynamic ProgrammingLongest Common Subsequencefrequency 12.6
- Max Sum of a Pair With Equal Sum of DigitsmediumArrayHash TableSortingHeap (Priority Queue)frequency 12.6
- Maximize Active Section with Trade ImediumStringEnumerationfrequency 12.6
- Maximum 69 NumbereasyMathGreedyfrequency 12.6
- Maximum Ascending Subarray SumeasyArrayfrequency 12.6
- Maximum Distance in ArraysmediumArrayGreedyfrequency 12.6
- Maximum Fruits Harvested After at Most K StepshardArrayBinary SearchSliding WindowPrefix Sumfrequency 12.6
- Maximum Score From Grid OperationshardArrayDynamic ProgrammingMatrixPrefix Sumfrequency 12.6
- Maximum Students Taking ExamhardArrayDynamic ProgrammingBit ManipulationMatrix+11frequency 12.6
- Maximum Sum of Subsequence With Non-adjacent ElementshardArrayDivide and ConquerDynamic ProgrammingSegment Treefrequency 12.6
- Maximum Value at a Given Index in a Bounded ArraymediumMathBinary SearchGreedyfrequency 12.6
- Merge In Between Linked ListsmediumLinked Listfrequency 12.6
- Merge Two Binary TreeseasyTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 12.6
- Minimized Maximum of Products Distributed to Any StoremediumArrayBinary SearchGreedyfrequency 12.6
- Minimum Common ValueeasyArrayHash TableTwo PointersBinary Searchfrequency 12.6
- Minimum Difference Between Highest and Lowest of K ScoreseasyArraySliding WindowSortingfrequency 12.6