Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in Go

Solution: Longest Path With Different Adjacent Characters

Explore how to compute the longest path in a rooted tree where adjacent nodes have distinct characters. This lesson guides you through using topological sorting and chain tracking to efficiently solve the problem with linear time complexity.

We'll cover the following...

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 ...