Search⌘ K
AI Features

Solution: Longest Path With Different Adjacent Characters

Solution: Longest Path With Different Adjacent Characters asks you to find the longest path in a rooted tree where neighboring nodes have different characters, then return its length.

Statement

You are given a rooted tree with nn nodes, numbered from 00 to n−1n - 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 ...