Hello Everyone,\n\nI recently appeared in Google Interviews and will like to share my experience. I applied via portal and recruiter reached out to me in mid-august and had some questions about my experience and tech stack I am working on. Phone Interview was scheduled after 15 days of call.\n\n**NOTE:** : I will not be sharing the exact question, but will try to get the same question from LC\n \n**Phone Interview**\nSupprisingly, there was no introduction. Directly jumped to problem\nThis question was based on Dijsktra algorithm, pretty straight forward. Similar Question (https://leetcode.com/problems/path-with-minimum-effort/)\nOnce we discussed and coded the approach, asked me one more question based on above approach with slight modification. Told the approach and coded that one as well.\nAt the end we discussed TC & we were done from this round\n\n**Verdict :** Hire\n\nReached out to recuriter several times, there was not any response. Thought, probably might haven\'t cleared the round so stopped preparing but 15-20 days later Recuriter reached out and mentioned that I had cleared first round and asked me, When I am ready to appear in next rounds ? I took 3 weeks of time for preparation\n\n\n**On Site Round 1:**\nWe first introduced each other and had some discussion around the work (Around 5 minutes) & then jumped to Coding part.\nThis has only one question, but had some follow up for the same and we had lot of discussion around edge cases/clarifications. It was again based on DFS approach, We discussed the approach and coded it. Interviewer was satisfied, asked follow up question like how can reduce TC (Kind of Memoization) & at the end discussed TC for both the approaches.\n\n**Verdict:**  Hire / Strong Hire\n\n\n**On Site Round 2:**\nInterviewer pasted the problem statement without any test case & I had to read the problem statement, prepare testcases and clarify doubts, if any. At first instance, this seemd to be knapsack problem where we have to take/skip elements from array to maximize the result. I coded recusive approach, interviewer was satisfied with that then asked to optimize TC, did memoization. Then we had discussion around memory optimization, so had to select different DS for Memoization. \nWe were left with ~8 minutes, interviewer mentioned that can it be solved in linear TC i.e. O(n). I had to think, came with an approach after sometime and interviewer satisfied with that but couldn\'t code it.\nAt the end, it seems to be Sliding Window problem, something similar to these two (https://leetcode.com/problems/sliding-window-maximum/description/) \nhttps://leetcode.com/problems/constrained-subsequence-sum/description/?envType=daily-question&envId=2023-10-21\n\n\n**Verdict:** Lean Hire\n\n**On Site Round 3**\nThis was last round, the problem was almost similar to this one but had some extra constrains & bit time taking while you code it (https://leetcode.com/problems/find-all-possible-recipes-from-given-supplies/). I discussed my approach, coded it but it took almost all the time, we were left with 3 minutes and interviewer pasted the next question based on the above one. I told my approach but again didn\'t have time to code it.\n\n**Verdict:** Lean Hire / Hire (No clear response from Recruiter)\n\n**On Site Round 4 (Googliness)**\nWill suggest to go through this https://www.youtube.com/@jeffhsipepi\n\n**Verdict:** Hire\n\n**About Me**\n2.5+ years of experience, currently working as SDE I at FAANG\n\nHad discussion with recruiter, he mntioned that L3 looks green but for L4 he asked for sometime.\n\nWhat are the chances for L4 ?\n\nCompensation: https://leetcode.com/discuss/compensation/4308997/Google-or-L3-or-Hyderabad

Hello Everyone,\n\nI recently appeared in Google Interviews and will like to share my experience. I applied via portal and recruiter reached out to me in mid-au