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 18 of 19
- Sum of Good Subsequences1 companyStaff
- Make Array Elements Equal to Zero5 companiesJunior
- Zero Array Transformation I5 companiesMid/Senior
- Zero Array Transformation II5 companiesMid/Senior
- Shift Distance Between Two Strings1 companyMid/Senior
- Zero Array Transformation III5 companiesMid/Senior
- Find the Maximum Number of Fruits Collected2 companiesStaff
- Minimum Array Sum6 companiesMid/Senior
- Smallest Number With All Set Bits3 companiesJunior
- Identify the Largest Outlier in an Array4 companiesMid/Senior
- Maximize the Number of Target Nodes After Connecting Trees I2 companiesMid/Senior
- Maximize the Number of Target Nodes After Connecting Trees II2 companiesStaff
- Minimum Operations to Make Array Values Equal to K4 companiesJunior
- Transformed Array4 companiesJunior
- Maximum Area Rectangle With Point Constraints I2 companiesMid/Senior
- Maximum Subarray Sum With Length Divisible by K4 companiesMid/Senior
- Maximum Area Rectangle With Point Constraints II2 companiesStaff
- Maximize Amount After Two Days of Conversions3 companiesMid/Senior
- Minimum Operations to Make Character Frequencies Equal2 companiesStaff
- Count Subarrays of Length Three With a Condition5 companiesJunior
- Check if Grid can be Cut into Sections3 companiesMid/Senior
- Minimum Number of Operations to Make Elements in Array Distinct5 companiesJunior
- Maximum Number of Distinct Elements After Operations4 companiesMid/Senior
- Smallest Substring With Identical Characters I2 companiesStaff
- Find the Lexicographically Largest String From the Box I5 companiesMid/Senior
- Count Special Subsequences2 companiesMid/Senior
- Count the Number of Arrays with K Matching Adjacent Elements5 companiesStaff
- Longest Subsequence With Decreasing Adjacent Difference2 companiesMid/Senior
- Maximize Subarray Sum After Removing All Occurrences of One Element2 companiesStaff
- Maximum Subarray With Equal Products1 companyJunior
- Find Mirror Score of a String2 companiesMid/Senior
- Maximum Coins From K Consecutive Bags2 companiesMid/Senior
- Zigzag Grid Traversal With Skip3 companiesJunior
- Maximum Amount of Money Robot Can Earn5 companiesMid/Senior
- Minimize the Maximum Edge Weight of Graph2 companiesMid/Senior
- Count Non-Decreasing Subarrays After K Operations2 companiesStaff
- Maximum Difference Between Adjacent Elements in a Circular Array5 companiesJunior
- Minimum Cost to Make Arrays Identical2 companiesMid/Senior
- Manhattan Distances of All Arrangements of Pieces3 companiesStaff
- Count Partitions with Even Sum Difference5 companiesJunior
- Maximum Frequency After Subarray Operation4 companiesMid/Senior
- Find Valid Pair of Adjacent Digits in String3 companiesJunior
- Reschedule Meetings for Maximum Free Time I5 companiesMid/Senior
- Reschedule Meetings for Maximum Free Time II4 companiesMid/Senior
- Maximum Difference Between Even and Odd Frequency I4 companiesJunior
- Maximum Difference Between Even and Odd Frequency II6 companiesStaff
- Sort Matrix by Diagonals5 companiesMid/Senior
- Count Substrings Divisible By Last Digit1 companyStaff
- Sum of Good Numbers2 companiesJunior
- Separate Squares I4 companiesMid/Senior
- Separate Squares II2 companiesStaff
- Length of Longest V-Shaped Diagonal Segment5 companiesStaff
- Check If Digits Are Equal in String After Operations I4 companiesJunior
- Check If Digits Are Equal in String After Operations II2 companiesStaff
- Maximize the Distance Between Points on a Square2 companiesStaff
- Find the Number of Copy Arrays2 companiesMid/Senior
- Find Minimum Cost to Remove Array Elements3 companiesMid/Senior
- Find the Largest Almost Missing Integer2 companiesJunior
- Longest Palindromic Subsequence After at Most K Operations1 companyMid/Senior
- Lexicographically Smallest Generated String5 companiesStaff
- Fruits Into Baskets II5 companiesJunior
- Fruits Into Baskets III4 companiesMid/Senior
- Maximize Subarrays After Removing One Conflicting Pair5 companiesStaff
- Unique 3-Digit Even Numbers2 companiesJunior
- Longest Special Path II1 companyStaff
- Maximum Unique Subarray Sum After Deletion5 companiesJunior
- Closest Equal Element Queries4 companiesMid/Senior
- Zero Array Transformation IV1 companyMid/Senior
- Count Beautiful Numbers1 companyStaff
- Maximum Containers on a Ship1 companyJunior
- Find the Minimum Amount of Time to Brew Potions6 companiesMid/Senior
- Minimum Operations to Make Array Elements Zero4 companiesStaff
- Reverse Degree of a String2 companiesJunior
- Maximize Active Section with Trade I1 companyMid/Senior
- Longest Palindrome After Substring Concatenation I2 companiesMid/Senior
- Longest Palindrome After Substring Concatenation II1 companyStaff
- Minimum Pair Removal to Sort Array I5 companiesJunior
- Minimum Pair Removal to Sort Array II3 companiesStaff
- Minimum Operations to Make Array Sum Divisible by K4 companiesJunior
- Find Closest Person4 companiesJunior
- Make Array Non-decreasing1 companyMid/Senior
- Count Cells in Overlapping Horizontal and Vertical Substrings1 companyMid/Senior
- Count Covered Buildings2 companiesMid/Senior
- Path Existence Queries in a Graph I1 companyMid/Senior
- Path Existence Queries in a Graph II1 companyStaff
- Maximum Product of Two Digits1 companyJunior
- Fill a Special Grid1 companyMid/Senior
- Merge Operations for Minimum Travel Time1 companyStaff
- Find Most Frequent Vowel and Consonant3 companiesJunior
- Minimum Operations to Convert All Elements to Zero4 companiesMid/Senior
- Minimum Deletions for At Most K Distinct Characters2 companiesJunior
- Equal Sum Grid Partition I4 companiesMid/Senior
- Equal Sum Grid Partition II2 companiesStaff
- Smallest Index With Digit Sum Equal to Index1 companyJunior
- Minimum Swaps to Sort by Digit Sum1 companyMid/Senior
- Maximum Profit from Trading Stocks with Discounts2 companiesStaff
- Minimum Absolute Difference in Sliding Submatrix2 companiesMid/Senior
- Maximize Count of Distinct Primes After Split1 companyStaff
- Best Time to Buy and Sell Stock V3 companiesMid/Senior
- Maximize Subarray GCD Score1 companyStaff