Google inc interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Google inc
3 rounds | 3 Coding
problems
Selected Interview preparation journey
Journey
I gave an on campus interview for google around july 2021. Google was the first company on the campus. I used to do cp in my college and as such I had not prepared for interviews as I did not expect any companies to come to our college this early.
Application story
Google was the first company in our campus and we were not expecting this. I was not ready for giving interviews as my summer internship at Cisco,Appdynamics had just ended and I was expecting to get an offer from there as well. By the time google came I had not got any calls from my previous company so just gave the interviews without any prep.
Why selected/rejected for the role?
I finally was able to get the offer as all my interviews went pretty well. All my rounds were mostly DSA based and since I had a cp background I didnot face much difficulty in getting those questions.
Preparation
Duration: 1 month
Topics: Mostly DSA, OS, OOM and a little bit of System Design
Tip 1 : Focus more on contextual clarity rather than solving more number of problems.
Tip 2 : Don't panic even if you are not selected by some companies. Just keep your head high and keep going.
Tip 3 : If you are good at DSA then it might be able to compensate even if you have a little less knowledge of OS or OOM as a fresher.
Application process
Where: Campus
Eligibility: 7 CGPA
Tip 1 : Keep your resume short.
Tip 2 : Its good to have some previous internships or good projects on your resume. It's very important to have a good resume as google shortlists based on your resume.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration60 Minutes
Interview date16 Jul 2021
Coding problem1
This was an online round only and there were 2 coding questions in this round. I remember 1.
1. Josephus
Moderate
30m average time
70% success
0/80
Asked in companies
‘N’ people are standing in a circle numbered from ‘1’ to ‘N’ in clockwise order. First, the person numbered 1 will proceed in a clockwise direction and will skip K-1 persons including itself and will kill a Kth person. Now (K+1)th person from 1 will start and will kill the Kth person from itself.
You have to find the position of the last person surviving with respect to initial numbering.
Note:
A person can also kill himself.
02
Round
Easy
Video Call
Duration40 Minutes
Interview date19 Jul 2021
Coding problem1
A DSA based round. Interviewer asked about intro and about some of the college projects I has mentioned in my resume. PS: Keep your intro brief as you are expected to solve all the questions in that given time.
1. Minimum Number of Platforms
Moderate
30m average time
70% success
0/80
Asked in companies
You have been given two arrays, 'AT' and 'DT', representing the arrival and departure times of all trains that reach a railway station.
Your task is to find the minimum number of platforms required for the railway station so that no train needs to wait.
Note :
1. Every train will depart on the same day and the departure time will always be greater than the arrival time. For example, A train with arrival time 2240 and departure time 1930 is not possible.
2. Time will be given in 24H format and colons will be omitted for convenience. For example, 9:05AM will be given as "905", or 9:10PM will be given as "2110".
3. Also, there will be no leading zeroes in the given times. For example, 12:10AM will be given as “10” and not as “0010”.
03
Round
Medium
Video Call
Duration60 Minutes
Interview date19 Jul 2021
Coding problem1
There were 2 questions asked in this round. They expect you to solve and code both the questions but it works even if you code 1 question completely and atleast provide solution to the other one and I remember the one I solved.
1. Minimize Cash Flow
Easy
15m average time
85% success
0/40
Asked in companies
You are given a list of ‘transactions’ between ‘n’ number of friends. who have to give each other money. The list consists of data of receiver, sender, and transaction.
Your task is to minimize the cash flow and the total number of transactions should also be minimum.
For example :
In figure 1 : friend-1 has to pay 2000$ to friend-2, and 4000$ to friend-3 and friend-2 has to pay 3000$ to friend-3.
In figure 2 : so we can minimize the flow between friend-1 to friend-2 by direct pay to friend-1 to friend-3
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - 1
1 rounds | 1 problems
Interviewed by Google inc
Rejected
6180 views
0 comments
0 upvotes
SDE - 1
1 rounds | 1 problems
Interviewed by Google inc
Rejected
1574 views
0 comments
0 upvotes
SDE - 1
3 rounds | 3 problems
Interviewed by Google inc
Rejected
0 views
0 comments
0 upvotes
SDE - 1
2 rounds | 3 problems
Interviewed by Google inc
Selected 0 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 115097 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 58238 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 35147 views
7 comments
0 upvotes