Leetcode 687. Longest Univalue Path

Given a binary tree, find the length (number of edges) of the longest path whose nodes all share the same value, where the path may lie anywhere in the tree. This is solved by a DFS that for each node computes the longest same-valued descending path into its children and combines left/right contributions to update the global maximum.

Asked at:

Question Timeline

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

Company

Level

Region

Early October, 2025

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 687. Longest Univalue Path

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact