Hello Guys,

Could you share your thoughts on the following question:

Given an undirected graph with node values as string, and a path to follow, you have to find a path which is most similar to the input path.

For example, for the following graph:

Please note that the value in the input path could be completely different from any existing node.

Input Path: ["KPG", "DPS", "SIN", "AUH"]

Expected Output: ["KUL", "DPS", "CGK", "AUH"]

Input Path: ["XXX", "TBS", "DME"]

Expected Output: ["ATH", "TBS", "DME"]