Longest Path With Different Adjacent Characters
Try to solve the Longest Path With Different Adjacent Characters problem.
We'll cover the following...
Statement
You are given a rooted tree with parent
of size parent[i]
is the parent of node