ALGODAILY

June 16, 2021

“Remember—boredom is the enemy, not some abstract "failure.”

- Tim Ferriss


Day 9: Lowest Common Ancestor

You're given a binary search tree and two of its child nodes as parameters. Can you write a method lowestCommonAncestor(root: Node, node1: Node, node2: Node) to identify the lowest common ancestor of the two nodes? The lowest common ancestor is the deepest node that has both of the two nodes as descendants.

In the below example, the lowest common ancestor of node 5 and 8 is 7.

/*
       7
      / \
     4   8
    / \
   1   5
*/

The method will called in the following manner: lowestCommonAncestor(root, node1, node2);.

You can assume our standard node definition for the tree vertices:

function Node(val) {
  this.val = val;
  this.left = this.right = null;
}

Constraints

  • Number of nodes in the BST <= 1000
  • The nodes will always contain integer values between -1000000000 and 1000000000
  • Expected time complexity : O(n)
  • Expected space complexity : O(1)

Get the Solution →

Have you seen this question before? We are frequently adding problems and may have updated the order. You can change the day that you're on in the settings panel. As always, you can see the solution and a full step by step explanation at this link.


Our technical interview course gets results. Love the daily emails? AlgoDaily exists to provide hand-held coding interview coaching and career resources to developers from non-traditional paths. In the course, you'll find:

Become An Affiliate

If you're a fan of AlgoDaily.com and would like to share the love, we want to reward you! If you run an app, community, blog, or simply have lots of friends interested in the course-- get yourself a nice side revenue stream. Sign up to be an affiliate of algodaily.com. Affiliates get a whopping 50% commission on subscriptions referred.

How does it work? Sign up here, and start sharing your link. When people make a purchase on AlgoDaily.com, you'll accrue 50% of the purchase price. Affiliates get paid out on month end.


One last thing-- if you liked this email, and found value in it, could you kindly forward it to a friend who might benefit?

Our mission is to make tough technical interviews accessible to all, especially those from non-traditional CS backgrounds. I'd deeply appreciate your help in spreading the word!

Thanks,
Jake

We'll send you over 100 of the most common coding interview questions, once a day with visual explanations. Join over 16,323 users who are doubling their salaries in 30 minutes a day. All subscribers get a free 86-page preview PDF with a week of study material.

Back
Terms and Conditions
Privacy

Ready for your dream job?

Welcome to the most accessible guide to technical interviews. Here's a preview of how the platform will look.

We believe that technical interviews are a matter of practicing well. We've referenced hundreds of resources on habit change, education design, and algorithms to design the best and most streamlined learning experience.

Learn more