Available question text
Given a rooted weighted tree with a value at each node, find a downward ancestor→descendant path whose node values are all unique that maximizes the total edge length, and return [max total length, minimum node count among all paths achieving that length].
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 3425. Longest Special Path
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source