Introduction
Case study
Here is the transcript.
My feedback
After 30 minutes, I also reviewed the code, and ran test case, and then pointed out the problem to store two paths in one variable.
Friday, September 13, 2019
Case study: 126 Word ladder II - simple version - find all paths
Sept. 13, 2019
It is my 10:00 PM as an interviewer on interviewing.io platform. I spent 42 minutes to interview the interviewee using word ladder II simple version, find all paths. It is learning experience for me as an interviewer, and also I like to explore the algorithm as an interviewer. It was exciting and I was so happy to learn from the mistakes, bugs written.
Here is the transcript.
I did point out the challenging part to apply BFS, how to store so many intermediate paths, what is space complexity concern.
After 30 minutes, I also reviewed the code, and ran test case, and then pointed out the problem to store two paths in one variable.
Here is the transcript.
After 30 minutes, I also reviewed the code, and ran test case, and then pointed out the problem to store two paths in one variable.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment