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
- Diagonal Traverse IImediumArraySortingHeap (Priority Queue)frequency 16.4
- Distance Between Bus StopseasyArrayfrequency 16.4
- Divide Array Into Increasing SequenceshardArrayCountingfrequency 16.4
- Earliest Finish Time for Land and Water Rides IImediumArrayTwo PointersBinary SearchGreedy+1frequency 16.4
- Employee ImportancemediumArrayHash TableTreeDepth-First Search+1frequency 16.4
- Encode String with Shortest LengthhardStringDynamic Programmingfrequency 16.4
- Erect the Fence IIhardArrayMathGeometryMinimum Enclosing Circlefrequency 16.4
- Extract Kth Character From The Rope TreeeasyTreeDepth-First SearchBinary Treefrequency 16.4
- Filter Occupied IntervalsmediumArraySortingfrequency 16.4
- Find Champion IeasyArrayMatrixfrequency 16.4
- Find Customers With Positive Revenue this YeareasyDatabasefrequency 16.4
- Find Elements in a Contaminated Binary TreemediumHash TableTreeDepth-First SearchBreadth-First Search+2frequency 16.4
- Find Followers CounteasyDatabasefrequency 16.4
- Find Latest Group of Size MmediumArrayHash TableBinary SearchSimulationfrequency 16.4
- Find Minimum Time to Reach Last Room ImediumArrayGraph TheoryHeap (Priority Queue)Matrix+1frequency 16.4
- Find Nearest Right Node in Binary TreemediumTreeBreadth-First SearchBinary Treefrequency 16.4
- Find PermutationmediumArrayStringStackGreedyfrequency 16.4
- Find Positive Integer Solution for a Given EquationmediumMathTwo PointersBinary SearchInteractivefrequency 16.4
- Find the Shortest SuperstringhardArrayStringDynamic ProgrammingBit Manipulation+2frequency 16.4
- Find the Subtasks That Did Not ExecutehardDatabasefrequency 16.4
- Flip GameeasyStringfrequency 16.4
- Flip Game IImediumMathDynamic ProgrammingBacktrackingMemoization+4frequency 16.4
- Frog Position After T SecondshardTreeDepth-First SearchBreadth-First SearchGraph Theoryfrequency 16.4
- GCD of Odd and Even SumseasyMathNumber Theoryfrequency 16.4
- Game Play Analysis IeasyDatabasefrequency 16.4
- Generalized AbbreviationmediumStringBacktrackingBit Manipulationfrequency 16.4
- Guess the Majority in a Hidden ArraymediumArrayMathInteractiveBoyer–Moore Majority Vote Algorithmfrequency 16.4
- Insert Delete GetRandom O(1) - Duplicates allowedhardArrayHash TableMathDesign+1frequency 16.4
- Iterator for CombinationmediumStringBacktrackingDesignIteratorfrequency 16.4
- K-diff Pairs in an ArraymediumArrayHash TableTwo PointersBinary Search+1frequency 16.4
- Keyboard RoweasyArrayHash TableStringfrequency 16.4
- Largest 3-Same-Digit Number in StringeasyStringfrequency 16.4
- Largest Perimeter TriangleeasyArrayMathGreedySorting+2frequency 16.4
- Largest Prime from Consecutive Prime SummediumArrayMathNumber Theoryfrequency 16.4
- Largest Subarray Length KeasyArrayGreedyfrequency 16.4
- Largest Values From LabelsmediumArrayHash TableGreedySorting+1frequency 16.4
- Latest Time You Can Obtain After Replacing CharacterseasyStringEnumerationfrequency 16.4
- Lonely Pixel ImediumArrayHash TableMatrixfrequency 16.4
- Lonely Pixel IImediumArrayHash TableMatrixfrequency 16.4
- Longest Common Subsequence Between Sorted ArraysmediumArrayHash TableCountingfrequency 16.4
- Longest Happy StringmediumStringGreedyHeap (Priority Queue)frequency 16.4
- Longest Uncommon Subsequence IeasyStringfrequency 16.4
- Longest Univalue PathmediumTreeDepth-First SearchBinary TreeDP on Treesfrequency 16.4
- Longest Word With All PrefixesmediumArrayStringDepth-First SearchTriefrequency 16.4
- Lowest Common Ancestor of a Binary Tree IIImediumHash TableTwo PointersTreeBinary Tree+2frequency 16.4
- Make Sum Divisible by PmediumArrayHash TablePrefix Sumfrequency 16.4
- Maximize Consecutive Elements in an Array After ModificationhardArrayDynamic ProgrammingSortingfrequency 16.4
- Maximize Subarrays After Removing One Conflicting PairhardArraySegment TreeEnumerationPrefix Sumfrequency 16.4
- Maximize Total Cost of Alternating SubarraysmediumArrayDynamic Programmingfrequency 16.4
- Maximum Average Subarray IIhardArrayBinary SearchPrefix Sumfrequency 16.4