All Google Coding Interview Questions
1878 questions we track for Google, most frequently asked first. Practice any of them in the code editor and get AI feedback on your solution.
- Junior26% (484)
- Mid/Senior52% (980)
- Staff22% (414)
Questionspage 14 of 19
- Maximum Score of a Node Sequence1 companyStaff
- Number of Flowers in Full Bloom8 companiesStaff
- Count Prefixes of a Given String1 companyJunior
- Count Unguarded Cells in the Grid6 companiesMid/Senior
- Escape the Spreading Fire4 companiesStaff
- Remove Digit From Number to Maximize Result6 companiesJunior
- Minimum Consecutive Cards to Pick Up1 companyMid/Senior
- Total Appeal of A String2 companiesStaff
- Largest 3-Same-Digit Number in String5 companiesJunior
- Count Nodes Equal to Average of Subtree5 companiesMid/Senior
- Check if There Is a Valid Parentheses String Path1 companyStaff
- Find the K-Beauty of a Number3 companiesJunior
- Number of Ways to Split Array7 companiesMid/Senior
- Maximum White Tiles Covered by a Carpet2 companiesMid/Senior
- Find Resultant Array After Removing Anagrams8 companiesJunior
- Largest Combination With Bitwise AND Greater Than Zero5 companiesMid/Senior
- Minimum Lines to Represent a Line Chart1 companyMid/Senior
- Check if Number Has Equal Digit Count and Digit Value2 companiesJunior
- Sender With Largest Word Count1 companyMid/Senior
- Minimum Obstacle Removal to Reach Corner3 companiesStaff
- Partition Array Such That Maximum Difference Is K2 companiesMid/Senior
- Successful Pairs of Spells and Potions7 companiesMid/Senior
- Count Subarrays With Score Less Than K5 companiesStaff
- Minimum Path Cost in a Grid2 companiesMid/Senior
- Naming a Company1 companyStaff
- Longest Binary Subsequence Less Than or Equal to K3 companiesMid/Senior
- Count Asterisks1 companyJunior
- Count Unreachable Pairs of Nodes in an Undirected Graph4 companiesMid/Senior
- Check if Matrix Is X-Matrix2 companiesJunior
- Count Number of Ways to Place Houses4 companiesMid/Senior
- Minimum Score After Removals on a Tree4 companiesStaff
- Decode the Message4 companiesJunior
- Spiral Matrix IV4 companiesMid/Senior
- Number of People Aware of a Secret6 companiesMid/Senior
- Evaluate Boolean Binary Tree1 companyJunior
- The Latest Time to Catch a Bus3 companiesMid/Senior
- Subarray With Elements Greater Than Varying Threshold4 companiesStaff
- Minimum Amount of Time to Fill Cups1 companyJunior
- Move Pieces to Obtain a String5 companiesMid/Senior
- Count the Number of Ideal Arrays4 companiesStaff
- Max Sum of a Pair With Equal Sum of Digits6 companiesMid/Senior
- Minimum Deletions to Make Array Divisible3 companiesStaff
- Number of Zero-Filled Subarrays4 companiesMid/Senior
- Shortest Impossible Sequence of Rolls1 companyStaff
- First Letter to Appear Twice2 companiesJunior
- Equal Row and Column Pairs6 companiesMid/Senior
- Make Array Zero by Subtracting Equal Amounts2 companiesJunior
- Maximum Number of Groups Entering a Competition1 companyMid/Senior
- Find Closest Node to Given Two Nodes4 companiesMid/Senior
- Longest Cycle in a Graph4 companiesStaff
- Merge Similar Items1 companyJunior
- Count Number of Bad Pairs4 companiesMid/Senior
- Task Scheduler II6 companiesMid/Senior
- Minimum Replacements to Sort the Array5 companiesStaff
- Number of Arithmetic Triplets2 companiesJunior
- Reachable Nodes With Restrictions2 companiesMid/Senior
- Check if There is a Valid Partition For The Array1 companyMid/Senior
- Largest Local Values in a Matrix4 companiesJunior
- Construct Smallest Number From DI String3 companiesMid/Senior
- Minimum Recolors to Get K Consecutive Black Blocks5 companiesJunior
- Shifting Letters II6 companiesMid/Senior
- Amount of Time for Binary Tree to Be Infected12 companiesMid/Senior
- Find the K-Sum of an Array3 companiesStaff
- Longest Subsequence With Limited Sum4 companiesJunior
- Removing Stars From a String4 companiesMid/Senior
- Minimum Amount of Time to Collect Garbage3 companiesMid/Senior
- Build a Matrix With Conditions1 companyStaff
- Strictly Palindromic Number2 companiesMid/Senior
- Number of Ways to Reach a Position After Exactly k Steps1 companyMid/Senior
- Longest Nice Subarray6 companiesMid/Senior
- Meeting Rooms III12 companiesStaff
- Most Frequent Even Element2 companiesJunior
- Optimal Partition of String4 companiesMid/Senior
- Divide Intervals Into Minimum Number of Groups7 companiesMid/Senior
- Longest Increasing Subsequence II1 companyStaff
- Maximum Matching of Players With Trainers3 companiesMid/Senior
- Smallest Subarrays With Maximum Bitwise OR5 companiesMid/Senior
- Smallest Even Multiple3 companiesJunior
- Reverse Odd Levels of Binary Tree4 companiesMid/Senior
- Sum of Prefix Scores of Strings4 companiesStaff
- Sort the People5 companiesJunior
- Longest Subarray With Maximum Bitwise AND6 companiesMid/Senior
- Number of Good Paths3 companiesStaff
- Remove Letter To Equalize Frequency4 companiesJunior
- Bitwise XOR of All Pairings3 companiesMid/Senior
- Number of Pairs Satisfying Inequality3 companiesStaff
- Number of Common Factors3 companiesJunior
- Minimize XOR6 companiesMid/Senior
- Find The Original Array of Prefix Xor4 companiesMid/Senior
- Paths in Matrix Whose Sum Is Divisible by K4 companiesStaff
- Number of Valid Clock Times1 companyJunior
- Range Product Queries of Powers5 companiesMid/Senior
- Largest Positive Integer That Exists With Its Negative5 companiesJunior
- Count Number of Distinct Integers After Reverse Operations1 companyMid/Senior
- Count Subarrays With Fixed Bounds9 companiesStaff
- Determine if Two Events Have Conflict2 companiesJunior
- Minimum Cost to Make Array Equal6 companiesStaff
- Words Within Two Edits of Dictionary4 companiesMid/Senior
- Height of Binary Tree After Subtree Removal Queries3 companiesStaff
- Apply Operations to an Array4 companiesJunior