Challenge
Challenge
Problem
Solutions
Submissions
Challenge Points: 30
Level: HardYou are given a tree of n nodes (no cycles, fully connected).
Each node has an index from 0 to n - 1.
The tree structure is provided using the array parent, where parent[i] is the parent of node i, and node 0 is the root (so parent[0] = -1).
You are also given a string s, where each character s[i] corresponds to the label assigned to node i.
You must find the maximum length of a path in this tree such that for every pair of adjacent nodes in the path, the characters assigned to them are different.
Return the length of this longest valid path.
Input: parent = [-1, 0, 1, 1, 3] s = "abcda"
Output: 4
Explanation:
Tree structure: 0 └─1 ├─2 └─3 └─4 Longest valid path is: 2 -> 1 -> 3 -> 4 Characters: c → b → d → a (all different)
Input: parent = [-1, 0, 1, 1, 2] s = "aaaaa"
Output: 1
Explanation:
Every adjacent pair has the same character. So each valid path length is 1.
Accepted:
Submission:
Report an issue
Code
You need toto run or submitYou need toto run or submit
Test Case
Test Result