Two mediums:

Food Stall - return shortest path to visit all food stalls (used dfs) in a tree with n children

input

ans should be 12
Dot Product - without using dictionary (used list of tuples). Follow up to reduce time complexity with Binary Search