Google

Google Software Engineer Onsite Coding Questions

1192+ questions from real Google Software Engineer Onsite Coding rounds, reported by candidates who interviewed there.

1192
Questions
8
Topic Areas
10+
Sources

What does the Google Onsite Coding round test?

The Google onsite coding round is the core technical evaluation. Software Engineer candidates typically see 2-3 algorithm and data structure problems. Problems range from medium to hard difficulty, and interviewers evaluate both correctness and code quality.

Top Topics in This Round

Google Software Engineer Onsite Coding Questions

Google interview

Dynamic Programming 2022

I recently did an onsite with Google for an L3/L4 position. https://leetcode.com/problems/paint-fence/ The questions I got from Google was very similar to this question. Thought I should give back to the community....

Google Onsite

Graph 2022

I was recently asked this in the Google Onsite round. Can anyone help with this question? Given the water capacity for each of n unmarked buckets in the form of an...

Google L4

Binary Tree 2024

Company: Google Stage: Onsite Problem :Given a tree having nodes with value 0 and 1. write a function to return the number of islands ? My solution: I Solved this problem with recurssive...

I was asked this question on a google onsite. Given an index and an input string find the char at the given index of the string. But here\'s the catch:...

I had a google virtual onsite round for their lateral hiring. The question I was giving was: Let us say that there is a home and a saloon that you want...

Hey Leetcoders, I had this amazing question given during my onsite interview how this can be solved ??? Given a list of points where each point represents a position of cake...

I had onsite recently with google and had 3 rounds as part of that . I cant share exact question, but can share leetcode question which mostly or completely resemble...

7 months in Google Team Matching

Team Matching,Google Process,Timeline 2026

Hey everyone, long post but I need to get this out and maybe hear from people who've been through something similar. Quick timeline: June 2025 — Started the Google interview process End of July 2025 —

Hi All, I want to thank Leetcode community and want to contribute back to the community with my experience with Google. I wont be posting the questions to respect NDA. But...

How many coins can be collected from a game board? Given a string representing a single row board with a maximum length of 100, containing characters '.', 'T', and 'C', representing empty positions, p

Given the number of courses `numCourses` and a list of prerequisite pairs `prerequisites`, where `prerequisites[i] = [a_i, b_i]` indicates that to take course `a_i` you must first complete course `b_i

Given an integer array A, you can choose at most one element and multiply it by -1. The goal is to make the sum of all elements in the array as close to 0 as possible. Return this minimum absolute sum

Given an integer array A, you can split it into two non-empty parts: left and right. Sort each of these parts separately and then concatenate them into a new array. The concatenated array must be non-

### Problem Overview - Build the largest possible integer by selecting at most three digits from the array while preserving their original order. - Input: array 'digits' of length N (3–50) with values

### Problem Overview - Count how many 4-digit codes (digits 0–9, leading zeros allowed) have a digit sum equal to S. - Input: integer S in [0..36]; Output: the number of valid codes. - Context: releva

Google Onsite Interview Questions and LeetCode Problem IDs

Arrays,Strings,Binary Tree,Linked List,Sorting,Binary Search,Onsite 2026

Google # **🧠 Arrays & Strings (Very High Frequency)** - Two Sum – LeetCode 1 - Best Time to Buy and Sell Stock – 121 - Product of Array Except Self – 238 - Longest Substring Without Repeating Charac

Google Onsite Interview Longest Path in Grid Question

Dynamic Programming,Matrix,Graph 2026

I got this question in my Google interview. Can someone let me know the solution for it ? Q: Given a 2D grid, it contains empty spaces (0) and some walls (1) We can enter the grid from any empty cell

Google SWE L3 L4 Coding Interview Questions Compilation Mar 2025

Arrays,Strings,Two Pointers,Graph,Binary Tree,Heap,Trie,Dynamic Programming,Intervals,Hash Table,Matrix,System Design,Ml,Probability Stats,Greedy 2026

*** # The Ultimate Questions List appeared on multiple platforms ### Arrays, Strings & Two Pointers - [] **Find Longest Duplicated Substring:** Find the longest contiguous sequence of characters that

Hi everyone, I recently completed my google loop, unfortunatly i was rejected because i bombed the round where i was asked this question, i panicked and managed only a brute force with a couple of hin

Google L5 Software Engineer Screening Interview Report

Dsa,Trie,Backtracking,Recursion,Hash Table,Binary Tree,Behavioral 2026

I recently got a call directly from a recruiter at Google since I had interviewed with them in the past (and declined an offer back then). This was a screening stage with: 1 DSA round 1 Googliness rou

What to Expect in the Google Onsite Coding Round

The Google Software Engineer Onsite Coding round has a specific calibration purpose distinct from other rounds in the loop. Across 1192+ verified reports on LeakCode for this exact round type, the consistent expectations: clear scoping of the problem before diving into a solution, explicit reasoning about complexity, structured handling of edge cases, and the ability to discuss trade-offs between two reasonable approaches.

Reports tagged with the Onsite Coding round at Google show recurring patterns in difficulty and topic distribution. The Onsite Coding round is typically 45-60 minutes; the interviewer is calibrated against a specific rubric. The discriminator between candidates who advance and candidates who do not is rarely the final correctness of the answer. It is the path: did you clarify, did you verbalize your approach, did you handle edge cases, and did you communicate throughout.

How To Prepare for This Specific Round

Filter the questions below to the most recent reports (past 6-12 months). Questions tagged for this exact round type from this exact company at this exact role level are the highest-signal data available. Older reports may reference questions that have since rotated out of the company's pool.

Practice 4-6 representative problems from this set under timed conditions. The goal is not memorization (companies rotate questions); the goal is to internalize the patterns the interviewer typically reaches for and the depth of follow-up to expect. Reports on LeakCode also tag the typical follow-up depth at this round type, which is the discriminating signal between hire and no-hire calibration.

Onsite Coding Round Timing and Format

The Onsite Coding round at Google typically runs 45-60 minutes. Use the first 2-3 minutes to clarify requirements; you should never start coding or designing without verifying the input/output format, constraints, and edge cases out loud. Use the next 5-7 minutes to verbalize your approach before writing any code. The middle 20-30 minutes are implementation. Reserve the final 10 minutes for testing with concrete examples and discussing optimization or trade-offs.

Time budget discipline is one of the most reliable senior-vs-junior discriminators in this round. Strong candidates verbalize where they are in their budget out loud ("I've used about 20 minutes, I have 15 minutes left for testing and one optimization"). This signals engineering maturity to the interviewer and creates positive feedback they can capture in writing.

Common Failure Modes in This Round

Reports tagged "no hire" at Google Software Engineer Onsite Coding commonly cite: coding silently without verbalizing approach, jumping to implementation before clarifying requirements, missing edge cases (empty input, single element, very large input), producing working code that the candidate cannot refactor when asked, and failing to test their solution with concrete examples before declaring done.

The single most predictive failure mode in 2025-2026 reports: not asking clarifying questions. Interviewers at all FAANG companies are explicitly trained to weight this dimension. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's notes.

See All 1192 Questions from This Round

Full question text, answer context, and frequency data for subscribers.

Get Access