the-most-similar-path-in-a-graph

< Previous 　　　　　　　　　　　　　　　　 Next >

1548. The Most Similar Path in a Graph (Hard)

Related Topics

[Dynamic Programming] [Graph]

Hints

Hint 1

Create an array dp where dp[i][j] is the min edit distance for the path starting at node i and compared to index j of the targetPath.

Hint 2

Traverse the dp array to obtain a valid answer.