Google Interview Experience by Shreyaa Balaji | On Campus - Jul 2022

New update is available. Click here to update.

SWE Intern

Google

3 rounds | 4 Coding problems

Anonymous

Fresher | Jul 2022

Selected

438 views

0 comments

0 upvotes

Interview preparation journey

Preparation

Duration: 2 months

Topics: Arrays, Stings, Stacks, Queues, Linked List, Trees, Graphs, BFS, DFS, Recursion, Dynamic Programming, Backtracking.

Tip

Tip 1 : I was informed about the interview only 3 days prior to it. So, if you find yourself in a position like me, one thing I would mention is to NEVER LEARN ANY NEW TOPICS if you have less than 2 days. Brush up on the topics you already know.
Tip 2 : Practise Time and space Complexities well. Know your basics and practice as many questions as possible on LeetCode.
Tip 3 : Refer to previously asked questions in the interview of the company. Read about the interview process for the role you're applying for. Learn about the role and the company as well.
Tip 4: If you're new to giving interviews, practice mock interviews with your friends or family.

Application process

Where: Campus

Eligibility: 6 CGPA

Resume tip

Tip 1 : Keep it to one side
Tip 2 : Only add the things necessary for the role that you're applying for.
Tip 3 : Don't lie in the resume and add projects related to the role.
Tip 4 : Add any volunteering work that you did.

Interview rounds

Round

Hard

Online Coding Test

Duration70 minutes

Interview date7 Jul 2022

Problems2

2 hard questions had to be completed in 70 Minutes. we had a time window from 12 pm to 6 pm.

Ninja And Numbers

Ninja has a number ‘A’ containing ‘B’ digits. ‘A’ can be represented by a string ‘S’ where ‘S[i]’ denotes the ‘ith’ digit of ‘A’. You are also given an integer ‘K’.

Try solving now

Count with K different characters

You are given a string 'str' of lowercase alphabets and an integer 'k' .

Your task is to return the count all the possible sub...

Problem approach

I first used brute force and I got TLE. So, I optimized the code using sliding windows and map and it passed all test cases.

Try solving now

Round

Medium

Video Call

Duration45 minutes

Interview date16 Aug 2022

Problems1

It was an online interview held on google meet. The interviewer shared a question in the beginning of the interview and for the next 45 minutes, we had to brainstorm approaches to solve the quesntion.

Buildings Projection

Ninja Land can be represented as a N * N grid in the XY plane. Each cell of this grid can have a building of some height.

Problem approach

I solved using a nested loop that had O(n^2) time complexity. After the interview, I was able to come up with a greedy approach with O(n) time complexity.

Try solving now

Round

Medium

Video Call

Duration45 Minutes

Interview date16 Aug 2022

Problems1

Closest Cost

Ninja is given the task to create a perfect gift for the king. He has ‘N’ wraps to choose from which he can choose to wrap the gifts. He also has ‘M’ gift...

Problem approach

I was it to figure out that this problem can be solved using a priority queue but I wasn't sure how. After trying different methods the interviewer give me a tip on how to use the priority queue method for this and I was able to grasp the logic for solving the problem.

Try solving now