Introduction
I just came cross the algorithm called Leetcode 333: Find largest binary search tree, and then I had chance to interview the peer in mock interview. He did very good job to explain the algorithm, write pseudo code, and also explain the algorithm using the test case to me.
Code review
I will review the algorithm and mock interview transcript later on. Here is the link.
Here is my C# practice based on the coding blog using optimal time complexity O(N).
No comments:
Post a Comment