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

SDE - 1

Google
upvote
share-icon
2 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Journey
I have completed my Engineering in Computer Science Engineering recently. In the second year, I started learning java and dsa from coding ninjas. After learning DSA i started working on projects. I was pretty confident on my skills. I used to practice dsa questions daily on Codezen. I was pretty much confident with my skills.
Application story
I got this opportunity on after I saw a post on LinkedIn for the role and had to share the resume via email . After that I updated my resume and shared it over the email with the description why I should be hired.
Why selected/rejected for the role?
I was rejected in technical round where I am unable to solve one of the questions given in technical round.
Preparation
Duration: 4 months
Topics: google kickstart problems, dsa, graphs, trees, stack
Tip
Tip

Tip 1 : practice regularly in kickstart rounds
Tip 2 : solve previous year problems
Tip 3 : coding ninjas also has google asked problems

Application process
Where: Email Approach
Eligibility: above 7 cgpa
Resume Tip
Resume tip

Tip 1 : Do not fake any skills, projects or achievements. The interviewer gets to know about it by asking questions to you.
Tip 2 : Have at-least one good project on resume with all the details like technologies used and purpose.
Tip 3 : Don't write achievements which doesn't relate to your role. Write achievements which shows communication skills, leadership or teamwork.

Interview rounds

01
Round
Medium
Online Coding Interview
Duration75 minutes
Interview date9 Feb 2021
Coding problem2

1. Minimum and Maximum Cost to buy N Candies

Hard
10m average time
90% success
0/120
Asked in companies
Paytm (One97 Communications Limited)Tech MahindraGroww

Ram went to a specialty candy store in Ninjaland which has 'N' candies with different costs.

The Candy shop gives a special offer to its customers. A customer can buy a single candy from the store and get at most 'K' different candies for free. Now, Ram is interested in knowing the maximum and the minimum amount he needs to spend for buying all the candies available in the store.

Note: In both cases, Ram must utilize the offer i.e. if 'K' or more candies are available, he must take 'K' candies for every candy purchase. If less than K candies are available, he must take all candies for a candy purchase.

For Example :

For 'N' =  5 and 'K' = 2

Let the cost of different candies in the store be: [9 8 2 6 4]

For the minimum amount: 
Ram can buy a candy with cost 2 and take candies with costs 9 and 8 for free. 
Then, he can buy a candy with cost 4 and take candy with cost 7 for free. 
Thus, the minimum cost will be 6 i.e. 2 + 4. 

For the maximum amount: 
Ram can buy a candy with cost 9 and take candies with costs 2 and 6 for free. 
Then, he can buy candy at cost 8 and take candy at cost 4 for free. 
Thus, the minimum cost will be 17 i.e. 9 + 8.

Thus, Minimum = 6 and Maximum = 17.
Try solving now

2. Swap And Maximise

Easy
10m average time
90% success
0/40
Asked in companies
PharmEasyGoldman SachsGoogle

You are given a circular array consisting of N integers. You have to find the maximum sum of the absolute difference between adjacent elements with rearrangement of array element allowed i.e after rearrangement of element find the maximum value of |a1 – a2| + |a2 – a3| + …… + |an – 1– an| + |an – a1|, where a1, a2, a3… an are the elements of the array.

An array is a circular array when after the last element 'an', 'a1' appears in the array.

Try solving now
02
Round
Hard
Online Coding Interview
Duration75 minutes
Interview date18 Mar 2021
Coding problem2

1. Connect N Ropes With Minimum Cost

Easy
20m average time
80% success
0/40
Asked in companies
MicrosoftPayPalPharmEasy

You have been given 'N' ropes of different lengths, we need to connect these ropes into one rope. The cost to connect two ropes is equal to sum of their lengths. We need to connect the ropes with minimum cost.

The test-data is such that the result will fit into a 32-bit integer.

Try solving now

2. Longest Increasing Subsequence

Moderate
30m average time
65% success
0/80
Asked in companies
Paytm (One97 Communications Limited)VisaOYO

For a given array with N elements, you need to find the length of the longest subsequence from the array such that all the elements of the subsequence are sorted in strictly increasing order.

Strictly Increasing Sequence is when each term in the sequence is larger than the preceding term.

For example:
[1, 2, 3, 4] is a strictly increasing array, while [2, 1, 4, 3] is not.
Try solving now

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

Which operator is used for exponentiation in Python?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
1 rounds | 2 problems
Interviewed by Google
2535 views
0 comments
0 upvotes
company logo
SDE - 1
1 rounds | 1 problems
Interviewed by Google
1604 views
1 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Google
3318 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Google
1498 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
107484 views
24 comments
0 upvotes
company logo
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
51829 views
5 comments
0 upvotes
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
32109 views
6 comments
0 upvotes