Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3615. Longest Palindromic Path in Graph
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source