InterviewDB Question

MongoDB SWE Phone - Lowest Common Ancestor

Question Details

Problem Find the lowest common ancestor of two nodes in a binary tree or binary search tree. Likely LeetCode equivalent LeetCode 236 - Lowest Common Ancestor of a Binary Tree. Tags binary_tree,recursion,dfs,swe

Full Details

🔒

Unlock all MongoDB questions

Full insider details, leaked discussions, and candidate experiences.

or every company, $100/year →

About This Question

This is a reported interview question from a mongodb interview during the phone round.

It covers the following topics: Binary Tree, Phone, Binary Search, Graph, Recursion, Coding .