Wednesday, July 10, 2019

Case study: Mock interview using lowest common ancestor

July 10, 2019

I spent one hour to interview an outstanding engineer, and he demonstrated how he solved the problem, the extended problem what if p and q are not in binary tree, and then distance between two nodes in binary tree.

Case study

I will write down some transcript the interviewee wrote in C# later.

No comments:

Post a Comment