Round 0 ( Prelims ) :

Global Panel, 8 pm IST timings, 1 question with two variations that used concepts of number of islands question on leetcode, on binary tree. Next variation was to find out number of different sizes of islands. These two variations, we were supposed to implement. Last variation, interviewer was just expecting to find logic, but not the code. In last variation, I had to find number of different non-isomorphic structures on all the islands in the binary tree. I solved that as well.

Verdict : STRONG HIRE

All indian panel below

Round 1 :

Question was extremely lengthy, it took me 15 minutes to understand the problem. I started coding the problem after 15 minutes, and finished every The problem shares similarities with Read-nSize() buffer question on leetcode. I can't describe the entire question, because of its length. ( TLDR; ) . I sincerely hope, nobody gets this question or you are screwed.

Verdict : HIRE

Round 2:

All questions were based on intervals. 1) Given set of intervals, find out, if all the intervals have anything in common.
2) Given intervals, findout minimum set of points S, such that each interval has at least one point in the S. ( made small mistake, interviewer pointed it out ) .

3. Given Two sets of intervals S and T, findout minimum subset of T, such that all the intervals of the S are covered. ( was really hard to solve , solved with hint ) .

I hope you get the first two questions in the interview, but not the third one. Also, I hope you don't get the same interviewer as mine. She was nice during the interview, She also said I performed well, and she liked the way I was thinking outloud. But she gave very bad feedback. I felt totally betrayed when I heard about the feedback.

Verdict : LEANING NOT HIRE

Round 3:

Again long descriptoin question, But not like Round1. It was easy to understand within 5-7 minutes. We were given one product "ABC", and we have to put sell orders for this product. Each sell order had selling-price, and the time when it was given. Each seller can have only one active order at a time.

You have to design data structure, where, seller will give orders SellOrder() ( O Log N )
If someone wants to buy the product, then find the cheapest order, which was given first ( chronologically ) .

I used sorted-set with comparator. Everything went well.

Verdict : HIRE

Round 4:

Googleyness questions. conflict resolution, managing certain situations etc etc. Interviewer was EXTREMELY FRIENDLY. I sincerely hope, everyone gets the same interviewer in Googeleyness round.

Verdict : HIRE

MY preparations :

My leetcode stats : 252 | 472 | 149 . I am 6 star rated on Codechef and Purple ( above 1900 ) on Codeforces.

MY KEY LEARNINGS FROM INTERVIEWS:

I have been doing CP from last 7-8 years and I can tell you one thing. Google L4 interviews has nothing to do with CP. They are purely technical on how well do you understand real-life problems and use what kind of data structure to solve the problem. No matter how lengthy the problem, whether you are asking the right question or not that matters. There will be lot of ambiguity in question statement by purpose, and you have to talk to interviwer and clarify those things. Make your interview an interactive process, and not just one sided coding process.

If you start implementing without understnading the problem or clarifying the edge cases with interviewer then you won't probably make it. Also, don't use hints from interviewer, those are given as Negative feedback.