Leetcode 3615. Longest Palindromic Path in Graph

Find the maximum length of a simple path in an undirected graph (visit each node at most once) such that the sequence of node labels forms a palindrome. With n ≤ 14, the problem reduces to exploring subsets/pairs of endpoints (e.g., bitmask DP / bidirectional expansion) while enforcing matching characters from both ends.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 3615. Longest Palindromic Path in Graph

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact