Leetcode 2246. Longest Path With Different Adjacent Characters

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