Note: Please don't forget to UPVOTE if this interview experience helps you!!! so that it remains in feed and more readers will reach this and get benefitted !!! Thanks to everyone !!!

Status: Software Engineer (Exp: 4 Years, Service Based MNC)
Interview for,
Position: L3 at Google
Location: Bangalore, KA, IN
Date: July, 2021

Leetcode Status: 110 (Easy-50, Medium-51, Hard-9) ~ 25 Days

HR Screening Round (Phone) : Duration : 15-30 minutes
This is an obvious round HR will just try to see how much prepared you by asking some basic questions related to time and space complexity, prefered algorithm for a scenario, best sorting/searching algorithm, and etc.

Phone Screen Round (Google Meet) : Duration : 45 minutes
In this round the interviewer directly started asking some question from my resume for 5 mins.
Problem: Caching and Filter realted question on key-value pair data set to optimize the API, with some follow up to handle some scenarios.
Update-1: Given an method performing some DB operation. The traffic on this method is more. The method takes key as input and value as output. Requirement was to minimize the DB calls. Used a cache to cache recently used key-value pairs for future calls.

Result: Positive

Virtual On-Site Round - 1 (Google Meet) : Duration : 45 minutes
In this round interviewer initally spend 5 mins in introduction before jumping into problem.
Problem: Given an array of unique numbers and a sum value K. Find the best permutation and combination of the list of numbers resulting the sum from 1-to-K.
Example: Array=[1, 5, 10], K=5, Output=[1,1,1,1,5]
Explanation: Sum 1 to K i.e. (1, 2, 3, 4, 5) can be get from output list of numbers
Update-1:
The give output array [1,1,1,1,4] can used to form number from 1 to K.
1 = Sum of [1]
2 = Sum of [1, 1]
3 = Sum of [1, 1, 1]
4 = Sum of [1, 1, 1, 1]
5 = Sum of [5].
Here [1, 1, 1, 1, 1] is not consider because of array size i.e. size of [5] is 1 which is optimal and prefered where size of [1, 1, 1, 1, 1] is 5 which is non optimal, so not prefered answer. Whereas to get sum 4 we used [1, 1, 1, 1] because we 1 in out input array which we can use to get a sum value 4.
Basically, we need to find an optimal set of number from the input array so that using minimum numbers from output array we get a sum from 1 to K

Virtual On-Site Round - 2 (Google Meet) : Duration : 45 minutes
In this round interviewer spent 2-3 mins in introduction before jumping into problem.
Problem: Word Search and Auto-Complete suggestion problem. Given a list of words as input, get the word if present in word list or provide auto-complete suggestion for query words.
Example: Input Array=["he", "hit", "hits", "hint"]
Query-Word= "he", Output=["he"]
Query-Word= "hi", Output=["hit", "hits", "hint"]

Virtual On-Site Round - 3 (Google Meet) : Duration : 45 minutes
In this round interviewer spent around 5 mins in introduction before jumping into problem.
Problem: Similar to Island problems in Leetcode, with couple of follow up.

Virtual On-Site Round - 4 (Google Meet) : Duration : 45 minutes
Interview delayed by 30 mins because of meeting link confusion (But it did not cost the total interview duration). In this round interviewer directly jumped into problem as the interview was delayed.
Problem: A DFS problem to find an optimal path between two nodes in the graph. Should consider the path weight while finding an optimal one.
Condition: Need to find shorted path between two nodes with maximum weight.
Explanation: If there are two shortest paths with same number of nodes between source and destination then need to pick the path with maximum weight value sum.
Update-1:

• Here the path can be considered as shortest based upon number of steps we take from source to destination.
• Each step we take comprises of some value which we can consider as weight for that path/step.
• So we need to find a shortest path i.e. path with less number of steps take from source to reach destination but with maximum path_value/weight.
• If we have 4 best paths which same number steps then we need to consider the path with maximum path_value/weight and return the path as output.

Virtual On-Site Round - 5 - Googliness (Google Meet) : Duration : 45 minutes
In this round interviewer spent around 5 mins in introduction. And then started with general behavioral questions like how to handle ambiguity/conflict, approach to handle difficult situtation, and etc.

Result: After a week got update that there was mixed feedback so they cannot move ahead with my profile. Got feedback to improve problem solving speed, handle edge test cases, time management, and etc.

Update-1 : 29-July-2021 : Tried to answer questions from comment. Please find answer with tag Update-1 above. Please comment below if you have any more questions.

Note: Please don't forget to UPVOTE if this interview experience helps you!!! so that it remains in feed and more readers will reach this and get benefitted !!! Thanks to everyone !!!