Hi all,I recently interviewed for google L3 role.
College : Old IIT
Years of Experience : 2+ years
I received the feedback from the recruiter only in terms of positive/negative for all the rounds. The following are my assumptions for the round ratings along with what recruiter said.
Round 1: Strong Hire(Positive)
Round 2: Hire(Positive)
Round 3: Lean Hire(Negative)
Googlyness: Hire/StrongHire(Positive)

Round 1:

1. Find max length subarray which has all the element equal to key.(Two pointer question)
   Example : Given array a = [1,2,2,1,3,4,5,2,3,2,2,2] and key 2 then max length of subarray containing only 2 is 3(last three element).

2. Now we are given key as querries, we need to give max length of subarray for each query.
   Example : Given array a = [1,2,2,1,3,4,5,2,3,2,2,2] and keys [1,2,3] , we have return [1,3,1]

3. Now we need to find max length of subarray if you are allowed at most k different element apart from key.
   Example : Given array a = [1,2,2,1,3,4,5,2,3,2,2,2] and key 2 and k = 2 that means we need to find a max subarray with at most 2 elements differing from key 2. Output = 6

Round 2 : Given an n ary tree we have to decode the string.
Example :
A
/ \
B(Hi) C
/ \
D(I) E(am)
Every leaf is linked to some decoded string which means every path from root to leaf has a decoded value.
"AB" -> "Hi"
"ACD" -> "I"
"ACE" -> "am"
Input will be a string that we need to decode if that is not possible return "Invalid".
Example "ABABACDACE" --> "HiHiIam"
"ABCBACE" --> "Invalid"

Round 3: Given an array where elements are sorted based on the first 28 most significant bits. Sort the array.
Example: [1,3,2,4,10,9] --> [1,2,3,4,9,10]
We can see the input array is sorted by first 28 most significant bits(which are all zeros in our example)
I gave a solution which used counting sort and O(n) time complexity. In my feedback the interviewer wrote that I used an array to store the 32 bits which is not required and hence gave me negative feedback. Even though I gave the optimal solution in terms of time compexity for such difficult problem, his feedback was negative and the round only went for 35 to 40 mins. Just after the interview, I thought this was one of the best interview I gave among the three but that was not the case eventually.

Recruiter has asked to wait for 1 to 2 months for team matching and said that there is very slim chances of me getting matched. Can I still hope for a team match given these reviews? Any suggestions are welcomed.
This is my first post on LC. Please ask clarifying question if you have any.
Thank you!