I have recently completed all interview rounds for Google Cloud Platform.

Generally, there are 4 rounds of interviews for GCP org and for other orgs there are 5 rounds of interviews.

Phone interview:
https://leetcode.com/problems/step-by-step-directions-from-a-binary-tree-node-to-another/

• Solved by finding an LCA then merging traversing paths from LCA.

After clearing phone interview, HR scheduled total 4 onsite rounds.

First round:

1. Given matrix which only contains 1 or 0. and We can flip either all row or column values into matrix. Return true if you can make all zeros else return false

• Solved using backtracking.
• I could not come up with optimized solution.

Second round:

1. Check word and it's ambigram word is same or not
   Ex. pod -> convert it to upside down , it will be 'pod'
   for 'a'-> 'e'
   for 'd' -> 'p'

• Solved using left right pointer

2. Check word and it's Ambigram word is part of input list of words or not

• Solved using set

Third round:
Behavioral round

Fourth round:

1. Replace string variable with it's value.
   Ex. printf("hi %d", 1)

It should show hi 1

• Solved by traversing from right to left and replacing value.

2. Check cycle exist in Graph.

• Solved using dfs

UPDATE: For first round I got negative feedback.

And for last round I got comment that code was not readable. Will give interview after 10 months.