**UPDATE 2** : **HC asked for additional round**\n\n---\n**UPDATE** : **Got Shorted listed for HM round.**\n\n---\nExperience: SDE 2.4 years of fullstack dev (Java react).\nCollege: Tier 3\n\n\nWhat do you thing odds are on my side?\n\nOn 18th Oct, I gave my last Googliness interview \nWaiting for result.\n\n---\n\n**Phone Screening**\nA Tree based DFS question with 2 followups (med-hard)\nSolved it pretty quick missed an edge case but got through it.**\n\n---\n\n**Onsite 1: (Best round)**\nIt was a DP question, spicy variation on LIS + 2 followups\nBest round I would say, we had 10 min left even after coding the folloups\nSelf Verdict : **Strong Hire**\n\n---\n**Onsite 2: (Hell round)**\nIt was a hashmap easy-med question but the question was so vague it took 5-10 min to clarify the requirenemnt, but solved it with required complexity.\nBut the follow-up question OMFG, the interview said "look at the code & do something (no hints or direction to think)".\nIt took me a lot of time to figure out the enhancement in code.\n**Note**: Interviewer wasn\'t very supportive, else it would have been very quick as he didn\'t respond in "yes or no" just a "**hmmmm**".\nI proposed 2-3 things he just said hmm on all and I had no clue which one to confidently proceed on.\nLast 5 min remaining on clock and we agreed to Linked-list approach. Started coding but missed null pointer check (which I recalled post interview) and also the way inbuilt Java linked-list was used had some bugs. Altho logic was 100% correct.\nSince we were done with the time, I\'m not sure if he had any more questions for me.\nSelf Verdict: **Lean no hire/ Lean hire**\n\n---\n**Onsite 3: (Decent-good round)**\nSo it was a graph question (med-hard), It could be solved with DFS/ BFS.\nThe followup was tricky (DFS/ BFS + DP)\nSo we had our discussion and I explained him my approach, it seemed ok, but I was not able to put it in words cause obviously recursion.\nSome mistakes:\n * The number of E was (n * (n - 1)) at first I said n but later corrected it.\n * The complexity was V * (V + E)  without Dp and with DP it was (V + E)\n\t * I initially said V*(V+E) then said V+E (without mentioning of DP) and again switched to V*(V+E)\n\t\t * Last 5 min of clock and I said with DP it will be (V+E)\n\t\t\nsuggestion:\n*  Think before speaking something \n\nInterviewer was very helpfull and in the end we agreed on O(V + E)\nThere was no time left to code the followup (I felt interviewer was more inclined towards discussion rather than code, not sure if he also wanted me to code it)\nSelf Verdict: **Lean-Hire/ Hire**\n\n---\n**Googliness**\nSelf Verdict: Hire/ Strong Hire\n\n---\nAny chances I might get In?\n

UPDATE 2 : HC asked for additional round\n\n---\nUPDATE : Got Shorted listed for HM round.\n\n---\nExperience: SDE 2.4 years of fullstack dev (Java react).\nCol