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
- Maximum SwapmediumMathGreedyfrequency 34.8
- Minimum Area Rectangle IImediumArrayHash TableMathGeometryfrequency 34.8
- Multiply StringsmediumMathStringSimulationfrequency 34.8
- Repeated Substring PatterneasyStringString MatchingZ AlgorithmKnuth–Morris–Pratt Algorithmfrequency 34.8
- Vertical Order Traversal of a Binary TreehardHash TableTreeDepth-First SearchBreadth-First Search+2frequency 34.8
- Design Hit CountermediumArrayBinary SearchDesignQueue+1frequency 34.2
- Exclusive Time of FunctionsmediumArrayStackfrequency 34.2
- H-IndexmediumArraySortingCounting Sortfrequency 34.2
- Managers with at Least 5 Direct ReportsmediumDatabasefrequency 34.2
- Minimum Time to Finish the RacehardArrayDynamic Programmingfrequency 34.2
- Next Special Palindrome NumberhardBacktrackingBit Manipulationfrequency 34.2
- Partition Array Into Two Arrays to Minimize Sum DifferencehardArrayTwo PointersBinary SearchDynamic Programming+5frequency 34.2
- Shortest Path in Binary MatrixmediumArrayBreadth-First SearchMatrixfrequency 34.2
- Shuffle the ArrayeasyArrayfrequency 34.2
- Word Search IIhardArrayStringBacktrackingTrie+1frequency 34.2
- Balanced Binary TreeeasyTreeDepth-First SearchBinary Treefrequency 33.7
- Binary Tree Right Side ViewmediumTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 33.7
- Bus RouteshardArrayHash TableBreadth-First Searchfrequency 33.7
- Combination Sum IVmediumArrayDynamic Programmingfrequency 33.7
- Diagonal TraversemediumArrayMatrixSimulationfrequency 33.7
- Find And Replace in StringmediumArrayHash TableStringSortingfrequency 33.7
- Find Pivot IndexeasyArrayPrefix Sumfrequency 33.7
- Kth Largest Element in a StreameasyTreeDesignBinary Search TreeHeap (Priority Queue)+2frequency 33.7
- Min Cost Climbing StairseasyArrayDynamic Programmingfrequency 33.7
- Rank Transform of an ArrayeasyArrayHash TableSortingfrequency 33.7
- Redundant ConnectionmediumDepth-First SearchBreadth-First SearchUnion-FindGraph Theoryfrequency 33.7
- Remove Outermost ParentheseseasyStringStackBracket Sequencesfrequency 33.7
- Score of a StringeasyStringfrequency 33.7
- Snapshot ArraymediumArrayHash TableBinary SearchDesign+1frequency 33.7
- Subarrays with K Different IntegershardArrayHash TableSliding WindowCountingfrequency 33.7
- TrianglemediumArrayDynamic Programmingfrequency 33.7
- Best Time to Buy and Sell Stock with CooldownmediumArrayDynamic Programmingfrequency 33.1
- Combination Sum IImediumArrayBacktrackingfrequency 33.1
- Count and SaymediumStringfrequency 33.1
- Count of Smaller Numbers After SelfhardArrayBinary SearchDivide and ConquerBinary Indexed Tree+4frequency 33.1
- Customer Who Visited but Did Not Make Any TransactionseasyDatabasefrequency 33.1
- Find Eventual Safe StatesmediumDepth-First SearchBreadth-First SearchGraph TheoryTopological Sort+2frequency 33.1
- Find K Pairs with Smallest SumsmediumArrayHeap (Priority Queue)frequency 33.1
- Find Longest Special Substring That Occurs Thrice ImediumHash TableStringBinary SearchSliding Window+1frequency 33.1
- Find X-Sum of All K-Long Subarrays IeasyArrayHash TableSliding WindowHeap (Priority Queue)frequency 33.1
- Find the Safest Path in a GridmediumArrayBinary SearchBreadth-First SearchUnion-Find+2frequency 33.1
- Max Area of IslandmediumArrayDepth-First SearchBreadth-First SearchUnion-Find+1frequency 33.1
- Moving Average from Data StreameasyArrayDesignQueueData Streamfrequency 33.1
- Reconstruct ItineraryhardArrayStringDepth-First SearchGraph Theory+5frequency 33.1
- Remove Duplicate LettersmediumStringStackGreedyMonotonic Stackfrequency 33.1
- Reverse String IIeasyTwo PointersStringfrequency 33.1
- Richest Customer WealtheasyArrayMatrixfrequency 33.1
- Shortest Unsorted Continuous SubarraymediumArrayTwo PointersStackGreedy+2frequency 33.1
- Single-Threaded CPUmediumArraySortingHeap (Priority Queue)frequency 33.1
- Subarray Sums Divisible by KmediumArrayHash TablePrefix Sumfrequency 33.1