Location: Bangalore
Interview Date: April 2019 - May 2019
I got call through employee referral

Telephonic Round:

1. Time/Space complexity of some sort algorithms(merge sort, quick sort)
2. Calculate 2^24 (Asked to check how interactive you are with the interviwer)

Round-1(Skype):
You have N dices having K faces each numbered 1 to K. What's probability of generating sum S by rolling all N dices.

Solved with DP and was called for On-Site interviews at Bangalore

Round-2(On-Site)

Given a array of pairs(start IP and end IP ) of IP address, and one more IP address as a input. Return the index of a pair in which the given IP address lie.
Solved using binary search

Round-3(On-Site)

Given a complete binary tree. Find the total number of nodes in tree.
Tree was structured in such a way that: If it has N nodes, it will give numbers in 1,2,3,..., N after level order traversal.

Solved using DFS and Binary Search

Round-4 (On-Site)
It was a googliness and culture fitment round
I was asked various situation based questions. It was just to check your thought process and confidence

Lunch
I was asked to have lunch with a Google employee. I also had some interesting discussion with him :-)

Round-5 (On-Site)
A question related to string was asked. Don't remeber exactly.
Gave brute-force approach.

Round-6 (On-Site)

1. A matrix of size mxn was given which consists of 0 or 1 only. Find largest possible square having all 1's.
   Solved using DP

2. Give array of numbers. If same element exist in a sub-array of lenght 3 or more, remove all of the element in that sub-array. Return the resultant array after performing above operations.
   Solved using stack. Store element with the contiguous count of that element

Verdict: REJECTED