Longest Path With Different Adjacent Characters

Explore how to identify the longest path in a rooted tree where no two consecutive nodes share the same character. Understand the tree structure, constraints, and apply topological sort concepts to solve this coding interview problem efficiently.