Google inc interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Google inc
upvote
share-icon
3 rounds | 2 Coding problems

Interview preparation journey

expand-icon
Journey
My journey to cracking this job interview has been a year-long process of consistent learning, practice, and perseverance. I dedicated myself to preparing for over 8 to 10 months, starting with the fundamentals and gradually progressing to more complex topics. I focused heavily on mastering data structures and algorithms, knowing they would be central to both coding interviews and competitive programming. To make my preparation more structured and effective, I rigorously followed the Striver Sheet along with accompanying video lectures. This sheet provided me with a clear roadmap, covering a wide range of problems across various topics. The video lectures gave me a deeper understanding of key concepts, ensuring I not only solved problems but also grasped the underlying principles. By working through these resources, I built a strong foundation and gradually tackled more challenging problems with confidence. Throughout my preparation, I solved around 900-1,000 problems across various platforms. I made sure to cover a wide variety of questions, which helped me improve my problem-solving skills and gain a deeper understanding of different topics. I also practiced regularly on CSES, which helped me fine-tune my approach and tackle new challenges. Additionally, I participated in coding contests, providing the opportunity to simulate real-world interview conditions and sharpen my ability to think and solve problems under time pressure. One of the most significant learning moments in my journey came from regularly practicing the breakdown of problems, debugging, and optimizing solutions. This process helped me stay calm under pressure, think critically, and refine my problem-solving efficiency. I also worked on improving my speed, which became crucial during timed coding contests. The journey was not without its challenges. There were times when I struggled with difficult problems or faced plateaus in my progress. However, I remained persistent, revisiting concepts, analyzing different approaches, and constantly striving to improve. This rigorous, structured approach ultimately gave me the confidence and preparation needed for the interview. After months of dedicated effort, I’m excited to have reached this stage and am eager to take on new challenges ahead.
Application story
I applied for the position through my university's on-campus recruitment process. The first step was submitting my application online, where I uploaded my resume and other necessary documents. After the initial screening, I was shortlisted based on my performance in an online assessment (OA), which tested my coding skills, problem-solving abilities, and algorithmic knowledge. The OA was followed by a technical interview round, where I was assessed on my ability to solve problems and clearly explain my approach.
Why selected/rejected for the role?
I wasn't selected for the role primarily because I struggled to properly answer one of the technical questions during the interview. While I was able to explain my approach and think through the problem, I wasn't able to reach the optimal solution within the time frame. This experience taught me valuable lessons about the importance of both problem-solving efficiency and time management during interviews. Moving forward, I have focused on improving my speed, strengthening my fundamentals, and practicing a wider range of problems to ensure I'm better prepared for future opportunities.
Preparation
Duration: 10 months
Topics: Data Structure, Algorithm, OOPS, Operating System, DBMS
Tip
Tip

Tip 1: Prepare data structures like DP, graphs, trees, binary search, stacks, and queues thoroughly; eventually, a question will be based on these.

Tip 2: Prepare all types of standard questions, as most companies will ask them.

Tip 3: Don't take theoretical topics lightly; they are of equal importance.

Application process
Where: Campus
Eligibility: No criteria, (Salary Package - 35 LPA)
Resume Tip
Resume tip

Tip 1: Add rankings; numbers play a huge role in shortlisting.

Tip 2: Have some knowledge about the projects you have done.

Interview rounds

01
Round
Medium
Online Coding Test
Duration90 minutes
Interview date4 Nov 2023
Coding problem1

The online assessment (OA) for this role was held for all universities across India, with a common time window of 2-6 PM. This flexible timing allowed candidates to take the assessment at any time during this window, which was convenient. However, after a short period, many of the questions started circulating among peers, which made it easier for some candidates to get an idea of the questions in advance.Here were no strict proctoring measures, which meant that many candidates had the opportunity to discuss questions with friends during the exam window.

1. Frog Jump

Easy
30m average time
60% success
0/40
Asked in companies
MicrosoftDunzoCIS - Cyber Infrastructure

There is a frog on the '1st' step of an 'N' stairs long staircase. The frog wants to reach the 'Nth' stair. 'HEIGHT[i]' is the height of the '(i+1)th' stair.If Frog jumps from 'ith' to 'jth' stair, the energy lost in the jump is given by absolute value of ( HEIGHT[i-1] - HEIGHT[j-1] ). If the Frog is on 'ith' staircase, he can jump either to '(i+1)th' stair or to '(i+2)th' stair. Your task is to find the minimum total energy used by the frog to reach from '1st' stair to 'Nth' stair.

For Example
If the given ‘HEIGHT’ array is [10,20,30,10], the answer 20 as the frog can jump from 1st stair to 2nd stair (|20-10| = 10 energy lost) and then a jump from 2nd stair to last stair (|10-20| = 10 energy lost). So, the total energy lost is 20.
Problem approach

priority_queue< pair < int , int > >q; 
vector < int > ans , ans1 ;
for (int i =0; i < n ; i++ )
q.push ( make_pair ( E[i] , i ) ) ; 
int en = K ;
queue < int > reserve ; 
while(!q.empty)
{
int en1=q.top().first;
int i=q.top().second;
q.pop();
if(en>H[i])
{
en=en+en1;
ans.push_back(en);
while(!reserve.empty())
{
int j=reserve.front();
reserve.pop();
q.push(make_pair(E[j],j));
}
}
else
reserve.push(i);
}
ans1.push_back(ans.size());
for(auto i:ans)
ans1.push_back(i);
return ans1;
}

Try solving now
02
Round
Medium
Video Call
Duration60 minutes
Interview date30 Nov 2023
Coding problem1

45 mins for DSa, 15 mins for Googliness.

1. Rearrange The Array

Moderate
15m average time
90% success
0/80
Asked in companies
Thought WorksOracleOla

You are given an array/list 'NUM' of integers. You are supposed to rearrange the elements of the given 'NUM' so that after rearranging the given array/list there are no two adjacent elements present in the rearranged 'NUM' which will be the same.

For example:
Input: NUM[] = {1,1,1,2,2,2} 
Output: {1,2,1,2,1,2}
Note: {2,1,2,1,2,1} is also valid because there are no two adjacent which are the same.
Try solving now
03
Round
Easy
Video Call
Duration60 minutes
Interview date30 Nov 2024
Coding problem0

45 mins for DSa, 15 mins for Googliness

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
company logo
SDE - 1
1 rounds | 1 problems
Interviewed by Google inc
6180 views
0 comments
0 upvotes
company logo
SDE - 1
1 rounds | 1 problems
Interviewed by Google inc
1573 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 3 problems
Interviewed by Google inc
0 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 3 problems
Interviewed by Google inc
0 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
115097 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
58237 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
35147 views
7 comments
0 upvotes