I recently interviewed for google L4 India. I got following feedbacks:
Round 1 (telephonic): Hire
Round 2: Strong hire
Round 3: Weak unhire
Round 4 (googlyness): strong hire
Round 5: Weak hire
what are my chances to get the L4 role?
UPDATE:
lot of people asking me the interview questions. I ll say among all interviews I gave google ll ask the easiest questions. You need to focus on getting code correct in one shot. If you are able to do that you are selected. Hardest round will be round 1 which is telephonic round. If you get rejected there then not a problem you can re-apply. If you are rejected in onsite then you loose one chance out of 3. But telephonic rounds are easy. To me they asked:
telephonic:
find lowest comman weight path between 2 nodes in a tree. Simply a modification of LCA.
Onsite 1:
find number of islands in a matrix with 0 and 1.
Followup:
https://cses.fi/problemset/task/1192
strong hire feedback here. Was able to solve and implement both of the questions in 40 mins. 5 mins still remaining.
Onsite 2:
probably easiest yet I got paniced and messed this one. Split a given string based on space. Next part was to split it based on space but exclude spaces that are preceeded by "". That is if input is: "I love leet\ code" output ll be {"I", "love", "leet code"}. Basically you need to come with test cases in this problem. i missed cases like "I love \\ leetcode". The problem was more on forming test cases.
Onsite 3:
Probably the hardest question that was asked yet not too hard. Was able to clear that but code missed some test cases. I was able to cover those in next 30 seconds but feedback got lean hire since code that I gave did not work in one go. So lot of nit picks. (i wont type the question since it is too long to type and I am too lazy).
My takes:
You may say that no it is not the case, then I ll say cross check by giving the interview and tell me in comments.