Longest Path With Different Adjacent Characters

Explore how to solve for the longest path in a rooted tree such that adjacent nodes have different characters. Understand the problem constraints, tree representation, and apply topological sorting concepts to implement an efficient solution.