Available question text
Given a weighted tree and many queries of three distinct nodes (src1, src2, dest), return the minimum total weight of a connected subtree that contains all three nodes — which equals half the sum of their three pairwise distances. Precompute distances (e.g., via root-based distances + LCA) to answer each query in O(1).
Related questions
Continue with questions that share topics or the same question type.
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 3553. Minimum Weighted Subgraph With the Required Paths II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source