Solution: Longest Path With Different Adjacent Characters

Explore how to compute the longest path in a rooted tree with no two adjacent nodes sharing the same character. Understand using topological sort to process nodes in reverse order, calculate longest chains per node, and combine distinct child paths to determine the maximum valid path length.