Leetcode 1548. The Most Similar Path in a Graph

Given a graph where each node has a name and a target sequence of names, find a path of the same length whose node names minimize the total number of mismatches with the target sequence. This requires dynamic programming over path positions and graph nodes (with backpointers for reconstruction) to efficiently compute and recover the minimum-edit path.