Hello,

I recently had an opportunity to appear for interviews at Google, India for SE - Full Stack Developer role. The position was for experienced professionals. The interviews were conducted over Google Meet and each interview on a separate day. (You can discuss this with your recruiter how you want the interviews to be conducted, all on a single day or on separate days ).

Following are the interview rounds that were conducted.
Round 1, 2, 3 - Technical, only Coding no Design rounds. ( ~ 45 mins each)
Round 4 - Behavioural. ( 45 mins )

Round 1:
Given a grid n x m consisting of 0's and 1's, where 0 respresents a free cell and 1 represents a wall. If a robot is placed at first cell, i.e. position (0,0), find whether it can reach the end cell i.e. (n-1, m-1), by breaking at the most one wall in the grid.

Round 2:
This was based on OS job scheduling, and it was mostly open-ended question. I was not provided of how the input will be, these were the points that were to be discussed with interviewer.

Given a list of jobs, with their arrival time and execution time, return the sequence of execution and the starting time of each job, on a First Come First Serve(FCFS) basis.
Follow up question: If priority is associated with each job, how will the algo change in that case.

Round 3:
Given a n-ary tree, and 2 edges represented by the vertices connecting them (V1, V2) and (V3, V4). Return the number of vertices (nodes) in each disconnected component, if these 2 edges are removed from the tree, basically if the tree was disconnected. Given Q queries, return the result for each query, assuming tree is fully-connected each time.

Round 4:
Mostly all the questions were situation-based, like tell me about a time..., along with follow-up questions.