Available question text
Given a binary tree and a list of target nodes, find the lowest common ancestor — the deepest node whose subtree contains all the targets. The core challenge is to compute this in one traversal by aggregating which targets appear in each subtree (generalizing the standard LCA algorithm to k nodes).
Related questions
Continue with questions that share topics or the same question type.
- Lowest Common Ancestor of a Binary Search Tree
Coding
- Lowest Common Ancestor of a Binary Tree
Coding · Binary Lifting · Binary Tree · Depth-First Search
- Lowest Common Ancestor of a Binary Tree II
Coding
- Lowest Common Ancestor of a Binary Tree III
Coding · Binary Lifting · Binary Tree · Hash Table
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1676. Lowest Common Ancestor of a Binary Tree IV
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source