Lowest common ancestor in binary tree - Summary of interviews

July 4, 2019

Introduction 

I chose the tree algorithm called longest univalue path from August 2018. I spent three months to work on the algorithm in mock interview with a lot of engineers. But starting from May 2019, I choose the algorithm Lowest common ancestor instead. I have interviewed more than 15 times, I like to write some summary notes.

One tree algorithm

I have tried so many ideas to work on my problem solving skills. I hired a coach last June 2018 for two weeks, my friend told me that it is too expensive. She joined Facebook this May 2019. I know that the idea to work with a coach may not be a good idea. I have to be independent, be a problem solver. My friend just sent me an email through Linkedin.com, and ask me if I like to practice with her in 2018 when she prepares for Facebook interview. Being frugal is also very important in decision making.

I choose lowest common ancestor tree algorithm to interview on interviewing.io starting from May 2019. Since I could not learn backtracking and find the bug in my own code, I start to investigate how good people are in this industry.

I believe that this algorithm helped me tremendously. One thing I can do is to work on more algorithms, solve more problems. But learning and sharing experience through those mock interview hours are great.

I still remembered the feedback from hiring manager in top 100 software company I interviewed, he said that he does not ask the hard question like this in his interview.

I am getting better to interview senior engineers using this algorithm. Let me know if you like to practice together in the future, try this famous tree algorithm - Lowest common ancestor. I will help you find your weakness in tree algorithm problem solving.