Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 2246. Longest Path With Different Adjacent Characters
Find the longest simple path in a rooted tree where every pair of adjacent nodes have different characters; this is solved with a DFS/tree-DP that for each node computes the longest downward chain of valid characters and combines the top two child chains to update a global maximum (expect O(n) for n up to 1e5).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.