**Timeline :** July (2nd Week) \n**Reschedule count :** 3\n**Total Time spent :** 38-40 mints\n\n**Pre Join :** This is my very first interview with any non-indian interviewer, Technically I was scared if I could understand the accent and mindset of the interviewer as I had no experience with foreign interviewers (Typical low key insecurities). \n\n**Join :** Interviewer came after 7 minutes. Called me on my mobile first, Then we came up with GMeet link. Senior engineer from a very important google product\n\n**Started :** So, It started. He seemed a very cool guy. No shit talk, directly moved into the problem. \n\n**The problem :**\nThere is a binary tree (a sample tree was made with \u201C/\u201D, \u201C\\\u201D ). Tree has total three kind of nodes. \n\n1. Normal nodes : with two children\n2. Leaf nodes : no children\n3. Special nodes : only one children. \n\nMultiple consecutive Special nodes make a *Special nodes Chain*. like (a \u2192 b \u2192 c) are the node chain, so length is 3 here. First, he said to find the max chain length, later changed it to return all the unique chain lengths and its count in the tree. \n\nI discussed about the approach and complexities, went for DFS. And answer will be returned in a dictionary (Hashmap)\n\nSeems so easy problem but while implementing I messed up a little. Anyway while dry running I found my issue and fixed it. Throughout the process I explained everything and shared my thought process. He seemed very pleased with the solution. \n(Time spent so far 20+ mints)\n\nThen, he came up with the follow up, Proposed a huge tree similar to this, And made it open for all teams to use. How I am going to optimize it. \nFirst of all, I didn\u2019t understand the requirements, I questioned multiple times and tried to extract any hints, But to understand his hints I needed some hints too. Any way I proposed something different, I told to zip the special nodes chain and make a list of it. But The solution he was expecting, I couldn\u2019t come up with. Anyway he liked mine (The zipping solution) \n\n**End discussion :**\nI have always been a good, light hearted discusser. We discussed few google topics. He ensured me here, Nobody came up with the follow-up solution and that\u2019s not going to affect my flow **(consolidation I presumed)**\n\n**Results :** \nRecruiter called me after 5 days. Feedback was good. She planned next 4 rounds in upcoming weeks.  \n\n**Main Post** : [link](https://leetcode.com/discuss/interview-question/5650637/Google-L3-or-SWE2-or-India-Rejected)

Timeline : July (2nd Week) \nReschedule count : 3\nTotal Time spent : 38-40 mints\n\nPre Join : This is my very first interview with any non-indian interviewer,