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.
Start your Google mock interviewQuestions Google asks, live voice, scored. First one free.
- Junior26% (484)
- Mid/Senior52% (980)
- Staff22% (414)
Questionspage 17 of 19
- Shortest Subarray With OR at Least K II4 companiesMid/Senior
- Water Bottles II3 companiesMid/Senior
- Longest Strictly Increasing or Strictly Decreasing Subarray7 companiesJunior
- Minimum Cost Walk in Weighted Graph6 companiesStaff
- Score of a String5 companiesJunior
- Latest Time You Can Obtain After Replacing Characters1 companyJunior
- Minimum Sum of Values by Dividing Array1 companyStaff
- Count the Number of Special Characters I2 companiesJunior
- Right Triangles2 companiesMid/Senior
- Find All Possible Stable Binary Arrays I3 companiesMid/Senior
- Minimum Array End4 companiesMid/Senior
- Valid Word8 companiesJunior
- Minimum Number of Operations to Make Word K-Periodic2 companiesMid/Senior
- Taking Maximum Energy From the Mystic Dungeon5 companiesMid/Senior
- Find the Minimum Cost Array Permutation1 companyStaff
- Special Array I6 companiesJunior
- Special Array II6 companiesMid/Senior
- Sum of Digit Differences of All Pairs2 companiesMid/Senior
- Find the XOR of Numbers Which Appear Twice2 companiesJunior
- Find the Number of Distinct Colors Among the Balls3 companiesMid/Senior
- String Compression III7 companiesMid/Senior
- Maximum Sum of Subsequence With Non-adjacent Elements3 companiesStaff
- Count Days Without Meetings4 companiesMid/Senior
- Lexicographically Minimum String After Removing Stars7 companiesMid/Senior
- Clear Digits5 companiesJunior
- Count Pairs That Form a Complete Day I2 companiesJunior
- Count Pairs That Form a Complete Day II1 companyMid/Senior
- Maximum Total Damage With Spell Casting7 companiesMid/Senior
- Find Minimum Operations to Make All Elements Divisible by Three4 companiesJunior
- Minimum Operations to Make Binary Array Elements Equal to One I6 companiesMid/Senior
- Count the Number of Inversions4 companiesStaff
- Minimum Average of Smallest and Largest Elements2 companiesJunior
- Find the Minimum Area to Cover All Ones I5 companiesMid/Senior
- Maximize Total Cost of Alternating Subarrays1 companyMid/Senior
- Find the Minimum Area to Cover All Ones II4 companiesStaff
- Find the Maximum Length of Valid Subsequence I4 companiesMid/Senior
- Find the Maximum Length of Valid Subsequence II6 companiesMid/Senior
- Find Minimum Diameter After Merging Two Trees3 companiesStaff
- Alternating Groups I3 companiesJunior
- Alternating Groups II4 companiesMid/Senior
- Generate Binary Strings Without Adjacent Zeros4 companiesMid/Senior
- Count Submatrices With Equal Frequency of X and Y3 companiesMid/Senior
- Delete Nodes From Linked List Present in Array5 companiesMid/Senior
- Minimum Array Changes to Make Differences Equal2 companiesMid/Senior
- Maximum Score From Grid Operations3 companiesStaff
- Vowels Game in a String3 companiesMid/Senior
- Maximum Number of Operations to Move Ones to the End4 companiesMid/Senior
- Minimum Operations to Make Array Equal to Target4 companiesStaff
- Count the Number of Substrings With Dominant Ones5 companiesMid/Senior
- Check if the Rectangle Corner Is Reachable3 companiesStaff
- Find the Number of Winning Players1 companyJunior
- Minimum Number of Flips to Make Binary Grid Palindromic II1 companyMid/Senior
- Shortest Distance After Road Addition Queries I3 companiesMid/Senior
- Snake in Matrix1 companyJunior
- Find the Count of Monotonic Pairs I2 companiesStaff
- Find the Power of K-Size Subarrays I3 companiesMid/Senior
- Count Substrings That Satisfy K-Constraint I1 companyJunior
- Find the Largest Palindrome Divisible by K2 companiesStaff
- Final Array State After K Multiplication Operations I4 companiesJunior
- Final Array State After K Multiplication Operations II3 companiesStaff
- Find the Key of the Numbers1 companyJunior
- Hash Divided String1 companyMid/Senior
- Find the Count of Good Integers2 companiesStaff
- K-th Nearest Obstacle Queries1 companyMid/Senior
- Maximum XOR Score Subarray Queries1 companyStaff
- Convert Date to Binary1 companyJunior
- Reach End of Array With Max Score3 companiesMid/Senior
- Maximum Number of Moves to Kill All Pawns1 companyStaff
- Find Indices of Stable Mountains1 companyJunior
- Find a Safe Walk Through a Grid2 companiesMid/Senior
- Find the Maximum Sequence Value of Array1 companyStaff
- The Two Sneaky Numbers of Digitville4 companiesJunior
- Minimum Number of Seconds to Make Mountain Height Zero3 companiesMid/Senior
- Find the Occurrence of First Almost Equal Substring1 companyStaff
- Find the K-th Character in String Game I5 companiesJunior
- Find the K-th Character in String Game II3 companiesStaff
- Maximum Possible Number by Binary Concatenation2 companiesMid/Senior
- Sorted GCD Pair Queries1 companyStaff
- Construct the Minimum Bitwise Array I5 companiesJunior
- Find Maximum Removals From Source String1 companyMid/Senior
- Find X-Sum of All K-Long Subarrays I5 companiesJunior
- K-th Largest Perfect Subtree Size in Binary Tree1 companyMid/Senior
- Count The Number of Winning Sequences1 companyStaff
- Find X-Sum of All K-Long Subarrays II2 companiesStaff
- Count Substrings With K-Frequency Characters I1 companyMid/Senior
- Minimum Division Operations to Make Array Non Decreasing2 companiesMid/Senior
- Check if DFS Strings Are Palindromes1 companyStaff
- Find the Original Typed String I7 companiesJunior
- Find the Original Typed String II5 companiesStaff
- Total Characters in String After Transformations I4 companiesMid/Senior
- Find the Number of Subsequences With Equal GCD2 companiesStaff
- Total Characters in String After Transformations II2 companiesStaff
- Find Minimum Time to Reach Last Room I4 companiesMid/Senior
- Find Minimum Time to Reach Last Room II3 companiesMid/Senior
- Count Number of Balanced Permutations2 companiesStaff
- Maximum Frequency of an Element After Performing Operations I4 companiesMid/Senior
- Maximum Frequency of an Element After Performing Operations II3 companiesStaff
- Smallest Divisible Digit Product II3 companiesStaff
- Adjacent Increasing Subarrays Detection I4 companiesJunior
- Adjacent Increasing Subarrays Detection II1 companyMid/Senior