Back to posts 
Interview experience
Google · Software Engineer · Junior
Community-sourced A factual summary of an interview experience shared publicly outside interviewd.
Nov 1
In Progress
Overall Experience
A Google L3 software engineering process that ran over several months, with an online coding round, a behavioral round, and two onsite coding rounds. The candidate reported passing the later rounds, and the team match was still pending.
4 rounds
I
Posted by interviewdInterview Process (4 rounds)
Round 1 of 4: Coding / DSA
60 min
Question 1
MediumConnected Crop Arrangement: given an N x M garden grid and K crop types labeled 1 to K, where count[i] is the exact number of cells that must contain crop i, and sum(count) = N x M, construct any arrangement in which every cell has exactly one crop, crop i appears exactly count[i] times, and all cells of each crop form one connected region under up, down, left, and right adjacency. Input is N, M, and K, followed by the counts; output N rows of M integers. Example: input 2 3 3 with counts 2 1 3 has the valid output 1 1 2 / 3 3 3. Follow-up, Two Square Gardens: the field is an N x N garden and an M x M garden placed adjacent to each other, with sum(count) = N^2 + M^2, and the same connectivity rule applies.
Experience
The candidate's approach and outcome were not reported.
60 min
Question 1
MediumBehavioral interview questions. The specific prompts were not reported.
Experience
The round was conducted online and was described as overall not difficult.
60 min
Question 1
MediumLongest Non-Decreasing Subarray With One Replacement: given an integer array nums, change at most one element to any integer value (or none), and return the maximum length of a contiguous subarray in which each adjacent pair satisfies nums[i] <= nums[i + 1]. Input is n followed by the array; output is one integer. Aim for O(n) time. Example: nums = [1, 0, 3, 4, 5, 2, 3] has the answer 5, achieved by changing 0 to 1.
Experience
The round was an onsite, face-to-face coding interview. The candidate's approach and outcome were not reported.
60 min
Question 1
MediumMerge Two Ordered Sequences: given two integer arrays a and b, where adjacent elements define ordering constraints, determine whether both orders can be satisfied at once. If they cannot, output false. Otherwise output true and any merged sequence that contains every distinct element from both arrays and preserves the relative order of both. Example 1: a = [1, 2, 3] and b = [2, 4, 5] give true with the merged order 1 2 3 4 5. Example 2: a = [1, 6, 4] and b = [4, 1] give false because the constraints form a cycle.
Experience
The candidate's approach and outcome were not reported.
Loading comments…