Upload Button Icon Add office photos

Google

Compare button icon Compare button icon Compare

Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards

zig zag pattern zig zag pattern

Filter interviews by

Google Software Engineer, new Grad Interview Questions, Process, and Tips

Updated 10 Aug 2018

Google Software Engineer, new Grad Interview Experiences

1 interview found

I applied via Other and was interviewed in Jun 2018. There were 5 interview rounds.

Interview Questionnaire 

8 Questions

  • Q1. The next round was a technical phone screen. I was asked two questions. They were easier from google standards. I was made to code on a shared Google Doc (simulating a white board).
  • Q2. 1. Move Zeros from Leetcode
  • Ans. 

    Move all zeros to the end of the array while maintaining the relative order of the non-zero elements.

    • Iterate through the array and keep track of the index to place the next non-zero element.

    • When encountering a non-zero element, swap it with the element at the current index.

    • After iterating through the array, all zeros will be moved to the end while maintaining the order of non-zero elements.

  • Answered by AI
  • Q3. 2. Level order traversal of BST
  • Ans. 

    Level order traversal of a binary search tree (BST) is a breadth-first search algorithm that visits each level of the tree from left to right.

    • Use a queue to keep track of the nodes to be visited

    • Start with the root node and enqueue it

    • While the queue is not empty, dequeue a node and visit it

    • Enqueue the left and right child of the visited node if they exist

    • Repeat until all nodes have been visited

  • Answered by AI
  • Q4. The last round was a series of technical onsite interviews. These questions are absolutely new, and I had never seen them before.
  • Q5. 1. There is a train that passes the following path: L / \ ... L / \ ... L Each junction tells us the path it is going to take. Once the train passes it'll change the switch a...
  • Ans. 

    Determining the state of switches/junctions after N trains have passed through them.

    • Create an array to represent the state of each switch/junction

    • Iterate through each train and update the state of the corresponding switch/junction

    • Use a loop to simulate the passing of trains and updating of switches/junctions

    • Return the final state of the switches/junctions

  • Answered by AI
  • Q6. 2. Merge subsets with small twist
  • Ans. 

    Merge subsets of strings with a twist

    • Merge subsets of strings into a single array

    • The twist is that each subset should be reversed before merging

    • Return the merged array of reversed subsets

  • Answered by AI
  • Q7. 3. Write a program to solve the 15-Puzzle game. Given a matrix, where one block is empty, align them in the correct order 12 . 2 . 3 . 4 1 . 2 . 3 . 4 10 . 6 . 7 . 1 5...
  • Q8. 4. Number of islands with a twist
  • Ans. 

    Count the number of islands in a grid, where an island is a group of connected 1s.

    • Use depth-first search (DFS) or breadth-first search (BFS) to traverse the grid

    • For each cell with a 1, mark it as visited and explore its neighboring cells

    • Count the number of times you start a new DFS or BFS traversal

  • Answered by AI

Interview Preparation Tips

Round: Resume Shortlist
Experience: After submitting my resume, I was contacted by a recruiter. He asked me general questions about the timeline and status of my other interviews, and walked me through Google's hiring process.

Round: Test
Experience: This round is what Google calls 'Coding Sample'. It is a timed coding challenge consisting of two questions. I found both at a difficulty level of above average.

1. Given time in HH:MM format, what was the last time that could have been displayed using the same subset of digits?

2. There are N rose bushes in your garden. The roses are planted in a row and numbered from 1 to N (from left to right). You know exactly when each rose will come into bloom. Once flowering, the rose plant will bloom forever. Moreover, exactly one rose will start growing every day.
We mark out a continuous segment of the row in which roses are in bloom, and which cannot be expanded by adding other roses at either end. We call this a blossoming group. The size of such a group is the number of rose bushes in it.
Ex. Rose * Rose Rose
1 2 3 4
consists of two blossoming groups: [1:1] and [3:4]. Note that [3:3] is not a valid group, because it can be expanded by adding the fourth rose which is also flowering.
You particularly like long groups. These are blossoming groups containing at least K roses.
Your task is to find the latest day on which there are exactly M long blossoming groups.
Write a function:
class Solution {
public int solution (int[] A, int K, int M);
}
that, given a zero-indexed array A containing N integers (a permutation of numbers from 1 to N), where A[i] denotes the number of roses which will start blooming on day number i+1, returns the latest day (but not larger than N) on which there are exactly M long blossoming groups. If no such day exists, the function should return -1.

General Tips: Google does not spare you, it assess everything - your coding ability, comfort with data structures and algorithms, clean code, naming conventions, communication, thought process, how much time you took, did you ask the right clarifying questions, how many clues did you take.

From what I have realized, what matters the most is that you do not beat around the bush. Once you have thought of the solution, communicate it to your interviewer, he'll either ask you to code or think of a better solution. Think of all the corner cases prior to starting coding. Once you start coding, finish it cleanly in one complete go. Do not revisit your code multiple times to make corrections.

Also, Google takes its own sweet time with decisions. The entire process takes 5-6 weeks, and that is the best case.

I was rejected after the onsite interview. Usually, what follows is you talking to multiple teams who might be interested to hire you. If the team likes you and you like the team, only then a formal offer letter is extended.
Skills: Communication, Problem Solving, Analytical Skills, Time Management
Duration: 1-3 Months

Skills evaluated in this interview

Interview questions from similar companies

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via campus placement at KIIT University, Bhuvaneshwar and was interviewed in Jan 2024. There were 4 interview rounds.

Round 1 - Aptitude Test 

Avg level question on aptitude

Round 2 - Coding Test 

2 easy or medium level question

Round 3 - Technical 

(1 Question)

  • Q1. Ragarding oops they asked lot of question like new keyword, template, inheritence , acces modifier, and lot
Round 4 - HR 

(1 Question)

  • Q1. They ask situation base dquestion

Interview Preparation Tips

Interview preparation tips for other job seekers - After cracking in u have to pass their genesis program to .they will train u properly and take test if u pass the test u will converted into fte other wise they will fire u
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via campus placement at Vellore Institute of Technology (VIT) and was interviewed before Aug 2023. There were 3 interview rounds.

Round 1 - Aptitude Test 

Incudes all basics from NetCom, OS , English and medium level C / C++ program

Round 2 - Technical 

(2 Questions)

  • Q1. Asked which is my favorite programming language : proffered is C / CPP
  • Q2. Find the output , How polymorphism works , etc.
  • Ans. 

    Polymorphism in object-oriented programming allows objects of different classes to be treated as objects of a common superclass.

    • Polymorphism allows for flexibility and reusability in code.

    • It enables a single interface to be used for different data types or classes.

    • Examples include method overriding in inheritance and interfaces in Java.

    • Polymorphism can be achieved through method overloading and method overriding.

  • Answered by AI
Round 3 - HR 

(2 Questions)

  • Q1. Basic HR questions
  • Q2. Explain ur hobby
  • Ans. 

    My hobby is photography, capturing moments and telling stories through images.

    • I enjoy exploring different locations to find unique shots

    • I love experimenting with different lighting techniques

    • I often edit my photos to enhance their visual impact

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Takes around few months to onboard . In my case around 6 Months
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
Selected Selected

I applied via Campus Placement

Round 1 - Aptitude Test 

Easy-moderate question with coding and aptitude

Round 2 - One-on-one 

(1 Question)

  • Q1. Questions about microprocessor and the projects done
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Aug 2023. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. Explain about Projects Gaming question Case study
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via campus placement at Government College of Engineering, Salem and was interviewed in Aug 2023. There were 2 interview rounds.

Round 1 - Aptitude Test 

10 Genral Apti , 10 code apti duration 1 hr

Round 2 - Coding Test 

3 hrs, 2 Stages 1st stage 3 Question, 2nd stage have 3 Question

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

They will ask two sections one is c competative coding and aptitude if you can answer one section clearly go with it they will surely select you for the next round

Round 2 - Coding Test 

They will give three questions based on your preferred language you have to answer atleast the logic behind each questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident on what you are doing and be strong on the basics
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Referral and was interviewed before Sep 2023. There were 2 interview rounds.

Round 1 - Group Discussion 

Asked about tools, Currenttrend

Round 2 - HR 

(2 Questions)

  • Q1. Salary Discussion
  • Q2. Notice period, When going to join

Interview Questionnaire 

3 Questions

  • Q1. Basic Electronics
  • Q2. Microcontrollers and Microprocessors
  • Q3. C Programming

Interview Questionnaire 

1 Question

  • Q1. About GD&T

Google Interview FAQs

What are the top questions asked in Google Software Engineer, new Grad interview?

Some of the top questions asked at the Google Software Engineer, new Grad interview -

  1. 1. There is a train that passes the following path: L / \ ... L ...read more
  2. 2. Level order traversal of ...read more
  3. 1. Move Zeros from Leetc...read more

Tell us how to improve this page.

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5.1k Interviews
IBM Interview Questions
4.0
 • 2.4k Interviews
Oracle Interview Questions
3.7
 • 902 Interviews
Amdocs Interview Questions
3.7
 • 532 Interviews
Zoho Interview Questions
4.3
 • 516 Interviews
SAP Interview Questions
4.2
 • 308 Interviews
KPIT Technologies Interview Questions
3.4
 • 294 Interviews
Salesforce Interview Questions
4.0
 • 272 Interviews
Adobe Interview Questions
3.9
 • 251 Interviews
View all
Software Engineer
1.7k salaries
unlock blur

₹20 L/yr - ₹75 L/yr

Software Developer
1.1k salaries
unlock blur

₹20.8 L/yr - ₹60 L/yr

Senior Software Engineer
657 salaries
unlock blur

₹24 L/yr - ₹87.8 L/yr

Data Scientist
268 salaries
unlock blur

₹24.3 L/yr - ₹55.5 L/yr

Sde1
257 salaries
unlock blur

₹14 L/yr - ₹55 L/yr

Explore more salaries
Compare Google with

Yahoo

4.6
Compare

Amazon

4.1
Compare

Facebook

4.4
Compare

Microsoft Corporation

4.0
Compare
Did you find this page helpful?
Yes No
write
Share an Interview