Available question text
Find the longest simple path in a rooted tree where every pair of adjacent nodes have different characters; this is solved with a DFS/tree-DP that for each node computes the longest downward chain of valid characters and combines the top two child chains to update a global maximum (expect O(n) for n up to 1e5).
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 2246. Longest Path With Different Adjacent Characters
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source