AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Compare
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Clear (1)
Google Software Engineer, new Grad Interview Questions, Process, and Tips
Google Software Engineer, new Grad Interview Experiences
1 interview found
Anonymous
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.
- 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
- 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
- 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
- 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
Interview Preparation Tips
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
I applied via Naukri.com and was interviewed in Jan 2021. There were 3 interview rounds.
Interview Questionnaire
1 Question
- Q1. Oops concepts, Exception Handling & other Core Java concepts
Interview Preparation Tips
Go to companies' websites & create ur profile.
Update ur profile daily on naukri. 👍🏻
Interview Questionnaire
2 Questions
- Q1. What is Data
- Ans.
Data is a collection of facts, figures, or statistics that can be analyzed to gain insights and make informed decisions.
Data can be structured or unstructured
Data can be qualitative or quantitative
Examples of data include customer demographics, sales figures, and website traffic
Data can be analyzed using various tools and techniques to extract meaningful insights
- Q2. Data types
Skills evaluated in this interview
I applied via Recruitment Consultant and was interviewed in Dec 2020. There were 4 interview rounds.
Interview Questionnaire
1 Question
- Q1. Basics of redux and react es6 js css3
Interview Preparation Tips
Interview Questionnaire
1 Question
- Q1. In C# --> Abstraction, Interface , Abstract Method, Abstract Class, Polymorphisms, Encapsulation ,Inheritance, Serialization,
- Ans.
C# concepts including abstraction, interface, abstract method, abstract class, polymorphism, encapsulation, inheritance, and serialization.
Abstraction: hiding implementation details
Interface: defining a contract for behavior
Abstract method: method without implementation
Abstract class: class with one or more abstract methods
Polymorphism: ability of objects to take on multiple forms
Encapsulation: bundling data and behavi...
Skills evaluated in this interview
I was interviewed before Dec 2020.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
This was a Data Structures and Algorithms round with preety good questions . I was expected to come up with an efficient approach and code it as well .
- Q1.
K Closest Points to Origin Problem Statement
Your house is located at the origin (0,0) of a 2-D plane. There are
Nneighbors living at different points on the plane. Your goal is to visit exactlyKneighb... - Ans.
Find the K closest points to the origin in a 2-D plane using Euclidean Distance.
Calculate the Euclidean Distance of each point from the origin
Sort the points based on their distances
Return the first K points as the closest neighbors
- Q2.
Power Set Generation
Given a sorted array of 'N' integers, your task is to generate the power set for this array. Each subset of this power set should be individually sorted.
A power set of a set 'ARR' i...
- Ans.
Generate the power set of a sorted array of integers with individually sorted subsets.
Use recursion to generate all possible subsets by including or excluding each element in the array.
Sort each subset before adding it to the power set.
Handle base cases for empty array and single element array.
Ensure the subsets are unique by using a set data structure.
Time complexity can be exponential due to the nature of generating
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Hard
This was also a DSA round where I was asked to code only one of the questions but I eventually ended up coding both as I had some spare time and explained my approches very smoothly to the interviewer . This round went preety well .
- Q1.
Roman Numeral to Integer Conversion
Convert a string representing a Roman numeral into its integer equivalent and return the result.
Explanation:
Roman numerals are represented by seven different symbol...
- Ans.
Convert a Roman numeral string to its integer equivalent.
Create a mapping of Roman numeral symbols to their integer values.
Iterate through the input string and add the corresponding integer values.
Handle cases where subtraction is needed (e.g., IV = 4, IX = 9).
- Q2.
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
... - Ans.
Find pairs of elements in an array that sum up to a given value, sorted in a specific order.
Iterate through the array and for each element, check if the complement (S - current element) exists in a hash set.
If the complement exists, add the pair to the result list.
Sort the result list based on the criteria mentioned in the question.
Return the sorted list of pairs.
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
This was also a DSA round with 2 questions . One was implementation heavy and the other was related to recursion and so I handled it carefully so that my code does not run into TLE or Segmentation Fault.
- Q1.
Arithmetic Expression Evaluation Problem Statement
You are provided with a string
expressionconsisting of characters '+', '-', '*', '/', '(', ')' and digits '0' to '9', representing an arithmetic express... - Ans.
Evaluate arithmetic expressions in infix notation with given operators and precedence rules.
Parse the infix expression to postfix using a stack.
Evaluate the postfix expression using a stack.
Handle operator precedence and parentheses while evaluating.
Ensure no division by zero cases and operands fit in 32-bit integer.
- Q2.
Remove Duplicates from Sorted Array Problem Statement
You are given a sorted integer array
ARRof sizeN. Your task is to remove the duplicates in such a way that each element appears only once. The outpu... - Ans.
Remove duplicates from a sorted array in-place with O(1) extra memory.
Use two pointers - one for iterating through the array and another for placing unique elements.
Compare current element with next element to identify duplicates and skip them.
Update array in-place by moving unique elements to the front.
Return the length of the array after removal of duplicates.
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
This was a typical System Design round where I was asked about the various features of Facebook and what sort of data structures and algorithms are used in implementing them .
- Q1. How does Facebook store likes and dislikes?
- Ans.
Facebook stores likes and dislikes using a combination of databases and algorithms.
Likes and dislikes are stored in databases such as MySQL or Cassandra.
Algorithms are used to analyze user behavior and recommend content based on likes and dislikes.
User interactions with posts, pages, and ads are tracked to determine likes and dislikes.
Likes and dislikes may also be used to personalize the user's feed and target ads mor
- Q2. How does Facebook implement graph search?
- Ans.
Facebook implements graph search using a graph database to efficiently search for connections between users and their interests.
Facebook uses a graph database to store connections between users, pages, groups, etc.
The graph search algorithm traverses the graph to find relevant connections based on user queries.
It takes into account factors like user relationships, interests, and interactions to provide personalized sea
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
This was a preety intense round as I was grilled more on my System Design concepts but eventually I was able to asnwers all the questions with some help from the interviewer.
- Q1. What is Hadoop and why is it used?
- Ans.
Hadoop is a framework for distributed storage and processing of large data sets.
Hadoop is used for storing and processing big data across a distributed network of computers.
It is based on the MapReduce programming model, which allows for parallel processing of data.
Hadoop consists of HDFS for storage and YARN for resource management.
It is used for tasks like data warehousing, log processing, recommendation systems, and...
- Q2. How does Facebook Chat work?
- Ans.
Facebook Chat works by using a combination of websockets, long polling, and push technology to deliver real-time messaging.
Facebook Chat uses websockets for real-time communication between the client and server.
Long polling is used to check for new messages when websockets are not supported.
Push technology is used to notify users of new messages even when the chat window is not open.
Messages are stored in a database an...
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
Interview Preparation Tips
Tips: Just try coding as much as you can in the four years of graduation.
Round: Interview
Experience: Three Coding Interview and a Behavioral Interview were conducted.
Tips: Try to get some prior knowledge about the company's infrastructure.w
General Tips: Practice as much problems as you can online or offline.
Skill Tips: Coding is the key for any software company.
Skills: Coding
College Name: IIT KHARAGPUR
Motivation: Its the best in business
I was interviewed before May 2016.
Interview Preparation Tips
Experience: it was elitmus test conducted by the company itself on campus. As per my knowledge only those scoring 90 percentile got selected for round 2.
Tips: Attempt only those ques that are necessary for scoring 90+ in e litmus. Specially in verbal don't attempt more then required questions, though you might be tempted. The aim is not to score max bt to score 90+
Round: Technical Interview
Experience: This was a programming based round. I was asked to write algorithms for various array linked list based problems. There was cross questioning prompting to reduce complexity and to use different data structures for same problems.
Mostly it focused on subjects like c, data structures and ADA.
Tips: Be clear with basic of data structures and algorithms. Pointers, queue, stacks, array linked lists, sorting etc are the keywords.
Round: Technical Interview
Experience: This was a information security specific round since that was my major. In depth cross questioning on my thesis topics, honeypots, network intrusion etc. Security certificates, and on the go problems to provide security solution layer wise in different scenarios. Security concept of torrents was also asked in detail.
Tips: It was more of a security discussion and throwing of ideas about how things in a particular case could work or could not. Don't worry about right or wrong answer just be clear with your reasoning about the solution you are suggesting.
Round: Other Interview
Experience: I don't know what to name this round, but it focused mainly on developing test cases for an object. Say they gave me a stapler and said to develop a test plan listing down test cases for a given object to pass so that it can be confirmed that it is a stapler. Another scenario was with a lift.
Tips: This is one round where your presence of mind and inter personal skills matter. I think the way you present your thoughts was most important here.
Round: Behavioural Interview
Experience: This was was mostly about how would you react in a given professional situation
Like your assigned work could not be completed on time, or if you are doing something wrong with the work assigned.
Tips: This is all about inter personal skills and putting your best foot forward :)
College Name: Indira Gandhi Delhi Technical University For Women, Delhi
Interview Questionnaire
8 Questions
- Q1. WRITE A GENERIC SWAP FUNCTION
- Ans.
A generic swap function swaps two values of any data type.
The function should take two parameters of any data type.
Use a temporary variable to store the value of one parameter.
Assign the value of the second parameter to the first parameter.
Assign the value of the temporary variable to the second parameter.
- Q2. SEARCH AN ELEMENT IN ROTATED SORTED LINKLIST .
- Ans.
Search for an element in a rotated sorted linked list.
Find the pivot point where the list is rotated.
Divide the list into two sublists based on the pivot point.
Perform binary search on the appropriate sublist.
Handle edge cases such as empty list and list with only one element.
- Q3. SEARCH AN ELEMENT IN ROTATED SORTED ARRAY. WRITED A CODE FOR IT
- Ans.
Search an element in a rotated sorted array
Find the pivot point where the array is rotated
Divide the array into two sub-arrays based on pivot point
Perform binary search on the appropriate sub-array
Repeat until element is found or sub-array size is 1
- Q4. In an Array of size 95 contain numbers in range 1 to 100. each number is at max once in the array. find the 5 missing numbers in array between 1-100
- Ans.
Find 5 missing numbers in an array of size 95 containing numbers in range 1 to 100.
Create a boolean array of size 100 and mark the present numbers
Iterate through the boolean array and find the missing numbers
Alternatively, use a HashSet to store the present numbers and find the missing ones
- Q5. Given sudoku as id array of size . in a given empty cell find the possible numbers that could be possible. Asked me to write code for it
- Ans.
Given a Sudoku board, find possible numbers for an empty cell.
Iterate through empty cells and check possible numbers using row, column, and box constraints.
Use a set to keep track of possible numbers for each empty cell.
Return the set of possible numbers for the given empty cell.
- Q6. Given 4 unsigned integers find their integer average (eg. (2,2,2,3) => (2+2+2+3)/4 = 2) consider integer division ) without typecasting
- Ans.
Find integer average of 4 unsigned integers without typecasting
Add all the integers and divide by 4
Use bit shifting to divide by 4
Handle overflow by using long long data type
Use unsigned int data type for input
- Q7. Write a code to identify wheter given processor is of 32 bit architecture or 64 bit architecture
- Ans.
Code to identify 32 bit or 64 bit architecture of a processor
Check if the operating system is 32 bit or 64 bit
If OS is 32 bit, processor is 32 bit
If OS is 64 bit, check if processor supports 64 bit architecture
Use CPUID instruction to check if processor supports 64 bit architecture
- Q8. Convert a binary number into base 64 integer
- Ans.
Convert binary number to base 64 integer
Divide the binary number into groups of 6 bits
Convert each group of 6 bits to decimal
Map the decimal value to the corresponding base 64 character
Concatenate the base 64 characters to form the final integer
Interview Preparation Tips
Experience: SIMPLE CODING QUESTIONS SPEED MATTERS.
Duration: 60 minutes
Total Questions: 3
Skills: Analytics And Coding
College Name: IIT Guwahati
Skills evaluated in this interview
Interview Questionnaire
6 Questions
- Q1. Solving puzzles(25 horses,ant and sweets,height of a building..) try as many as possible before appearing for interview
- Q2. If experienced , then project details of previous companies a must prepare question
- Q3. Writing test cases for random scenarios
- Q4. Programming in whatsoever language you r comfortable with, basic coding problems of DS,Algos. eg. Zigzag tree traversal algo,random linked list copy
- Q5. Some people asked me questions related to the work i will do if hired in the project
- Q6. Be genuine in ur CV, and be prepared with everything you write there.
Interview Preparation Tips
Google Interview FAQs
Recently Viewed
INTERVIEWS
Rakuten
No Interviews
DESIGNATION
DESIGNATION
INTERVIEWS
24/7 Customer
No Interviews
INTERVIEWS
Zomato
No Interviews
INTERVIEWS
No Interviews
LIST OF COMPANIES
Discover companies
Find best workplace
SALARIES
Tafe Motors & Tractors
SALARIES
Honda Motorcycle & Scooter
DESIGNATION
Tell us how to improve this page.
Google Interviews By Designations
- Google Software Engineer Interview Questions
- Google Software Developer Interview Questions
- Google Intern Interview Questions
- Google Senior Software Engineer Interview Questions
- Google Software Developer Intern Interview Questions
- Google SDE Interview Questions
- Google Softwaretest Engineer Interview Questions
- Google Data Analyst Interview Questions
- Show more
Interview Questions for Popular Designations
- Graduate Engineer Trainee (Get) Interview Questions
- Graduate Trainee Interview Questions
- Graduate Engineer Interview Questions
- Production Graduate Engineer Trainee Interview Questions
- Graduate Apprentice Trainee Interview Questions
- Graduate Apprenticeship Trainee Interview Questions
- Graduate Student Interview Questions
- Graduate Apprentice Interview Questions
- Show more
Interview Questions from Similar Companies
Fast track your campus placements
|
Software Engineer
1.8k
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Software Developer
1.1k
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Senior Software Engineer
680
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Data Scientist
274
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Sde1
242
salaries
| ₹0 L/yr - ₹0 L/yr |
Yahoo
Amazon
Microsoft Corporation
- Home >
- Interviews >
- Google Interview Questions >
- Google Software Engineer, new Grad Interview Questions
