...

/

Longest Path With Different Adjacent Characters

Longest Path With Different Adjacent Characters

Try to solve the Longest Path With Different Adjacent Characters problem.

Statement

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