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.