'Coding has over 700 languages', '67% of programming jobs aren’t in the technology industry', 'Coding is behind almost everything that is powered by electricity'
Google interview experience Real time questions & tips from candidates to crack your interview
Google
upvote
share-icon
2 rounds | 4 Coding problems
Interview preparation journey
expand-icon
Preparation
Duration: 4
Topics: Data Structures, Algorithms, Arrays, Trees, Hashing, 2 pointers, prefix sum, sorting implementations
Tip
Tip

Tip 1 : Build a strong resume reflecting your coding skills for the resume shortlisting round. (Mention some achievements to highlight your resume)
Tip 2 : Good knowledge of data structures and algorithms
Tip 3 : Proficient in at least one coding language.

Application process
Where:
Eligibility: No current backlogs
Resume Tip
Resume tip

Tip 1: Build a strong resume reflecting your coding skills including some simple projects in any tech bucket.
Tip 2: Mention some achievements to highlight your resume and different from other candidates.

Interview rounds
01
Round
Easy
Video Call
Duration45
Interview date7 Feb 2020
Coding problem2

The round was held in the evening, it was a telephonic interview on Google meet. The interviewer was very friendly and told me to relax and focussed.

1. Given an array A[] of size N, find the maximum number of operations required to delete all the elements from the array such that in one operation, if you delete the ith element (A[i]), you must also delete A[i] +1 and A[i] - 1 elements, if present.
Moderate
15m average time
85% success
0/80
Asked in companies
ArcesiumMicrosoftRubrik, Inc.

You have been given an array/list "ARR" consisting of 'N' integers. You have also given an integer 'K'.

View more
Problem approach

Tip 1:
Tip 2:
Tip 3:

Try solving now
2. Given the root of a generic tree and a node N, count the number of nodes between the two (inclusive both).
Moderate
25m average time
60% success
0/80
Asked in companies
OraclePaytm (One97 Communications Limited)JP Morgan

Given a binary tree and the value of two nodes, find the distance between the given two nodes of the Binary Tree.

Distance between two nodes is defined as the...

View more
Problem approach

Tip 1:
Tip 2:
Tip 3:

Try solving now
02
Round
Medium
Video Call
Duration45
Interview date7 Feb 2020
Coding problem2

Telephonic round on Google meet.
Duration : In the evening

1. Given an array A[] of integers of size N, check if every element of the array has a frequency >=2. The problem was displayed in a tricky manner. (A real life problem was mentioned before me)
Easy
10m average time
90% success
0/40
Asked in companies
GenpactAmazonMorgan Stanley

You are given an array/list 'ARR' of integers of length ‘N’. You are supposed to find all the elements that occur strictly more than floor(N/3) times in the given array/list.

Problem approach

Tip 1:
Tip 2:
Tip 3:

Try solving now
2. Given an array A[] of size N, find the number of subgroups you can create from this array such that each subgroup should consist of 5 consecutive elements.
Moderate
15m average time
80% success
0/80
Asked in companies
WalmartQuikrGoogle

You are given an array arr of N non-negative integers, you need to return true if the array elements consist of consecutive numbers otherwise return false.

View more
Problem approach

Tip 1:
Tip 2:
Tip 3:

Try solving now
Start a Discussion
Similar interview experiences
company logo
SDE - 1
2 rounds | 2 problems
Interviewed by Google
2167 views
1 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 4 problems
Interviewed by Google
2526 views
2 comments
0 upvotes
company logo
SDE - 1
3 rounds | 5 problems
Interviewed by Google
656 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Google
6349 views
4 comments
0 upvotes
Companies with similar interview experiences
company logo
2 rounds | 7 problems
Interviewed by Optum
200 views
0 comments
0 upvotes
company logo
1 rounds | 0 problems
Interviewed by Amazon
201 views
0 comments
0 upvotes
company logo
2 rounds | 2 problems
Interviewed by Amazon
114 views
0 comments
0 upvotes