Available question text
Given a tree and many queries specifying a path between two nodes, for each query return which candidate node (from a given set) is closest to any vertex along the simple path (or the distance to that nearest node). The core challenge is computing nearest-to-path distances efficiently across many queries by preprocessing tree distances/path structure to avoid walking the path per query.
Related questions
Continue with questions that share topics or the same question type.
- Binary Tree Maximum Path Sum
Coding · Binary Tree · Depth-First Search · DP on Trees
- Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree
Coding
- Closest Binary Search Tree Value
Coding · Binary Search · Binary Search Tree · Binary Tree
- Closest Binary Search Tree Value II
Coding · Binary Search Tree · Binary Tree · Depth-First Search
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 2277. Closest Node to Path in Tree
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source