Status: Experienced\nPosition: SDE2 at a decent Startup\nLocation: Bangalore, India\n\nHi All,\n\nI won\'t be posting the questions to respect NDA. But will provide details or similar questions on what to expect.\n\nBy the time I had given the first telephonic interview, I had solved 150 Leetcode questions with breakage of easy(20%) and medium(70%) and hard(10%).\n\nTechnical Phone Screen 1:\nThe interviewer asked 2 questions. 1st one was easy on simple maths algo and 2nd one was a medium question on designing a class to make a buffered reader.\nDidn\u2019t perform exceptionally well so had to give another phone screen after 15 days.\n\n2nd technical phone screen: \nThe interviewer asked a DP question, solved it in 2 methods DP and maths.\nThe interviewer was happy and we finished well in time and he asked a couple of behaviour questions as well.\n\nProceed to the virtual onsite interviews. By the time I had given virtual onsite interviews, I had solved 350 Leetcode questions, mostly medium (70% )and hard(30%).\n\nVirtual Onsite Interview[August 2020]\nInterview 1:\nThe first question was based on bfs, had to move from start to end with restrictions and find the max length of the ladder\nSimilar question: https://leetcode.com/problems/unique-paths-iii/\nA medium question solved and coded it.\n\nThe second question was based on a topological sort of unweighted directed graph.\nThe trick was to understand that it required topological sort since it was given in the form of finding the probability of reaching any node at infinite time.\nCouldn\u2019t find a similar question on leetcode.\nHard question. Got the solution but didn\u2019t code due to time constraint.\n\nThe interviewer seemed happy and I felt it was a decent round as I solved both questions.\n\n\nInterview 2:\nGraph-based question and different extension questions of finding cycles, validating if only one root node and various techniques to solve it.\nThe interviewer seemed happy with the solutions and it was a decent round.\n\n\n\nInterview 3:\nGraph-based question it was a mixture of the following two questions:\nhttps://leetcode.com/problems/number-of-closed-islands/\nhttps://leetcode.com/problems/max-area-of-island/\nMedium to hard question solved and coded it. The interviewer was happy with the solution and this was easily my best round.\n\nInterview 4:\n2 string-based questions first one was really easy solved it but took some time to understand it. The second was an extension of the previous one and was a really hard question. Gave a suboptimal solution and coded it. Then discussed an optimal solution.\nThe interviewer was not happy with the time I took to solve the first question but was happy with my approach to second question. \nWorst round as this was the only round where I got a lot of hints.\n\nInterview 5:\nGoogleyness round, standard behavioral questions. Just be honest and try not to be arrogant or proud and you can get through this round easily without much preparation.\n\nAfter 15 days I got to know that HC has approved my profile.\n\nNone of the questions were directly from leetcode but practicing questions on leetcode helped a lot. I have subscribed for premium and solved 80% question of google interview questions.\n\nHappy to help anyone who is looking for cracking a FAANG company. \nP.S. Can give the detailed questions to a few who reach out in comments.

Status: Experienced\nPosition: SDE2 at a decent Startup\nLocation: Bangalore, India\n\nHi All,\n\nI won\'t be posting the questions to respect NDA. But will pro