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 19 of 19
- Count the Number of Computer Unlocking Permutations3 companiesMid/Senior
- Count Partitions With Max-Min Difference at Most K4 companiesMid/Senior
- Count Special Triplets3 companiesMid/Senior
- Find Weighted Median Node in Tree1 companyStaff
- Find Maximum Area of a Triangle2 companiesMid/Senior
- Count Prime-Gap Balanced Subarrays1 companyMid/Senior
- Inverse Coin Change2 companiesMid/Senior
- Minimum Increments to Equalize Leaf Paths2 companiesMid/Senior
- Partition String1 companyMid/Senior
- Partition Array to Minimize XOR1 companyMid/Senior
- Maximize Spanning Tree Stability with Upgrades3 companiesStaff
- Coupon Code Validator2 companiesJunior
- Power Grid Maintenance7 companiesMid/Senior
- Minimize Maximum Component Cost4 companiesMid/Senior
- Process String with Special Operations II1 companyStaff
- Count Islands With Total Value Divisible by K2 companiesMid/Senior
- Count Number of Trapezoids I3 companiesMid/Senior
- Count Number of Trapezoids II2 companiesStaff
- Minimum Jumps to Reach End via Prime Teleportation4 companiesMid/Senior
- Partition Array for Maximum XOR and AND1 companyStaff
- Minimum Removals to Balance Array4 companiesMid/Senior
- Threshold Majority Queries4 companiesStaff
- Trionic Array I4 companiesJunior
- Trionic Array II6 companiesStaff
- Flip Square Submatrix Vertically2 companiesJunior
- Maximum Total from Optimal Activation Order2 companiesMid/Senior
- Next Special Palindrome Number1 companyStaff
- Minimum Sensors to Cover Grid4 companiesMid/Senior
- Minimum Cost Path with Edge Reversals8 companiesMid/Senior
- Minimum Cost Path with Teleportations4 companiesStaff
- GCD of Odd and Even Sums3 companiesJunior
- Partition Array Into K-Distinct Groups1 companyMid/Senior
- Jump Game IX4 companiesMid/Senior
- Two-Letter Card Game2 companiesMid/Senior
- Twisted Mirror Path Count2 companiesMid/Senior
- Minimum Operations to Equalize Binary String4 companiesStaff
- Balanced K-Factor Decomposition2 companiesMid/Senior
- Sum of Beautiful Subsequences2 companiesStaff
- Count Bowl Subarrays2 companiesMid/Senior
- Subsequence Sum After Capping Elements1 companyMid/Senior
- Number of Stable Subsequences1 companyStaff
- Maximize Alternating Sum Using Swaps1 companyStaff
- Split Array With Minimum Difference1 companyMid/Senior
- Maximum Partition Factor2 companiesStaff
- Longest Balanced Substring I4 companiesMid/Senior
- Longest Balanced Substring II6 companiesMid/Senior
- Sum of Perfect Square Ancestors3 companiesStaff
- Longest Balanced Subarray I4 companiesMid/Senior
- Lexicographically Smallest Permutation Greater Than Target2 companiesMid/Senior
- Longest Balanced Subarray II2 companiesStaff
- Maximize Sum of Squares of Digits1 companyMid/Senior
- Find Missing Elements2 companiesJunior
- Maximum Product of Three Elements After One Replacement2 companiesMid/Senior
- Minimum Time to Complete All Deliveries2 companiesMid/Senior
- Longest Non-Decreasing Subarray After Replacing at Most One Element1 companyMid/Senior
- Minimum Distance Between Three Equal Elements I2 companiesJunior
- Minimum Distance Between Three Equal Elements II3 companiesMid/Senior
- Maximum Path Score in a Grid2 companiesMid/Senior
- Maximize Cyclic Partition Score2 companiesStaff
- Count Distinct Integers After Removing Zeros1 companyMid/Senior
- Total Waviness of Numbers in Range I1 companyMid/Senior
- Concatenate Non-Zero Digits and Multiply by Sum II1 companyMid/Senior
- Minimum Absolute Distance Between Mirror Pairs4 companiesMid/Senior
- Largest Prime from Consecutive Prime Sum2 companiesMid/Senior
- Mirror Distance of an Integer2 companiesJunior
- Count Residue Prefixes2 companiesJunior
- Count Caesar Cipher Pairs1 companyMid/Senior
- Find Nth Smallest Integer With K One Bits1 companyStaff
- Minimum K to Reduce Array Within Limit1 companyMid/Senior
- Count Sequences to K2 companiesStaff
- Minimum Bitwise OR From Grid1 companyMid/Senior
- Find the Smallest Balanced Index2 companiesMid/Senior
- Construct Uniform Parity Array I2 companiesJunior
- Minimum XOR Path in a Grid1 companyMid/Senior
- Traffic Signal Color1 companyJunior
- Minimum Operations to Transform Array into Alternating Prime1 companyMid/Senior
- Longest Balanced Substring After One Swap1 companyMid/Senior
- Count K-th Roots in a Range2 companiesMid/Senior