Leetcode 3425. Longest Special Path

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].

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3425. Longest Special Path

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact