Leetcode Problem 2246. Longest Path With Different Adjacent Characters

2246. Longest Path With Different Adjacent Characters

Leetcode Solutions

Initialize an array children to store the children of each node.
Initialize a variable longestPath to 1, as a single node is always a valid path.
Define a recursive dfs function that takes the current node, its children, the string s, and the longestPath as parameters and returns the length of the longest chain starting from the current node.
In the dfs function, initialize longestChain and secondLongestChain to 0.
Iterate over each child of the current node, call dfs recursively, and update longestChain and secondLongestChain accordingly.
Update longestPath with the sum of longestChain, secondLongestChain, and 1 (for the current node).
Return longestChain + 1 to include the current node in the chain.
Start the DFS traversal from the root node (0).
Return longestPath as the final answer.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen