Challenge: Trace the Complete Path of a Journey

Test your knowledge on hash table traversal with this coding exercise!

Problem Statement #

You have to implement the trace_path() function which will take in a list of source-destination pairs and return the correct sequence of the whole journey from the first city to the last.

Input #

A Python dict containing string pairs of source-destination cities.

Output #

A list of source-destination pairs in the correct order.

Sample Input #

dict = {
  "NewYork": "Chicago",
  "Boston": "Texas",
  "Missouri": "NewYork",
  "Texas": "Missouri"

Sample Output #

[["Boston", "Texas"] , ["Texas", "Missouri"] , ["Missouri", "NewYork"] , ["NewYork", "Chicago"]]

Level up your interview prep. Join Educative to access 70+ hands-on prep courses.