Find the Lowest Common Ancestor in a Binary Search Tree
Company: Microsoft
Role: Machine Learning Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: HR Screen
Overview: Find the lowest common ancestor of two values in a binary search tree represented in level-order form. Use the BST ordering invariant to locate the first split point while handling root targets and ancestor relationships efficiently.
Read the full Microsoft Machine Learning Engineer interview experience this question came from