Introduction
It is my most favorite algorithm in 2018 called find smallest substring containing unique keys. That is the algorithm I have practice over 10 times from March 2017 to February 2018. And also it is the most popular interview question and I had one in 2015 January. I had a very good experience 45 minutes since I could not pass the phone screen, but I learned to be open and welcome the challenges as a programmer, show the world that I do care about learning the algorithm, and keep working hard as a software programmer.
This algorithm is the reason I start to write a coding blog starting from May 2015. I knew that I was not so good at learning, but I just started to document my learning and my emotions like feeling of struggling and then enjoy the journey to be a good thinker in algorithm and data structure.
My experience of interviewing
It is the Sunday morning 10:00 am mock interview. The peer had to work on the algorithm, and I worked with the peer 70 minutes until she finished the code, and also passed all test cases.
The first 30 minutes I went over my own blog to review the past practice, and once a while I stopped and gave some advice to the peer.
I do enjoy the interview. I do not have coworker as a programmer in my work place, I am a solo programmer. I really know that it is my own task to find the chance to work with people.
I learn from my experience on this algorithm, so I also like to share the tips to the peer through the mock interview.
Here is the C++ code I reviewed, and the code passes all test cases.
Here is the comment I wrote to share the advice after the mock interview.
My feedback after the mock interview
The peer worked very hard and also very open to advice, took the hint. The peer wrote the algorithm around 70 minutes including discussion, fixing all the bugs etc.
Just practice the same algorithm again and again, work on one thing a time.
No comments:
Post a Comment