脸熟 London E4 店面

The interview lasted for around 40 mins.

1 - [https://leetcode.com/problems/maximum-subarray/solution/] I explained and coded the most optimal solution for the question in around 5-6 Mins.
2- [https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/] with addition of Parent pointer I explained and coded the most optimal solution for the question in around 10-12 Mins. There was one bug where in I was calcuating the height recursively which took O(N) space and I quickly realised my mistake when the interviewer pointed in out that I was using O(N) space instead of O(1) and accordingly I made my code iterative.

At last I discussed the role with the interviewer for like 15 Mins.