Solution: Longest Path With Different Adjacent Characters

Statement

You are given a rooted tree with $n$ nodes, numbered from $0$ to $n - 1$, where the tree is connected, undirected, and has no cycles. The tree is represented by a 0-indexed array parent of size $n$, where parent[i] is the parent of node $i$ ...