Tipalti Interview Question
Home task: Given undirected, cyclic, not connected graph, find shortest path between 2 given nodes. Input is array of nodes, output sum of edges. Implement a solution in two hours and mail back
Interview Answer
Anonymous
Jun 24, 2020
This is Algorithms 1 problem.
12