Here's a sample AlgoDaily newsletter.

You can sign up for it at the bottom of this page.

ALGODAILY

September 18, 2021

Debugging is twice as hard as writing the code in the first place. Therefore, if you write the code as cleverly as possible, you are, by definition, not smart enough to debug it.

- Brian Kernighan


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.


Love the daily emails? AlgoDaily exists to provide hand-held coding interview coaching and career resources to developers from non-traditional paths. With premium, now on sale, 50% off, you'll get:

  • Unlimited access to all courses and materials
  • Customize your AlgoDaily newsletter by switching to Systems Design Daily or another crash course newsletter, and choosing the day you're on
  • Access to 400+ lessons and challenges, 1000+ diagrams and illustrations, 400+ quizzes, and 10+ hours of video
  • At least one new career building course added monthly
  • Bulk export all of your completed solutions, access the notes tool, track job applications, and see all community submissions
  • 100% advertisement free
  • Bonus: PDF, Mobi, and ePub copies of The AlgoDaily Book: Core Essentials (a $29 value)

Get Premium Today →


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 platform-- 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

Like the above? Try us for free.

We'll send you 100+ of the most common coding interview questions, once a day with visual explanations. Join over 25,323 users who are doubling their salaries in 30 minutes a day. All subscribers also get an 86-page interview fundamentals PDF and a week of lessons for free.