This comment is hidden because it contains spoiler information about the solution
This solution is built off basic Javascript and clearly shows each actionable step.
+1 don't mutate original array
Agreed. This solution is not as performant as it ought to be. It's using O(n) lookups just to check visited nodes, for example.
How can this be a best practive, or clever, if it walks the entire graph even after it has found a solution?
Loading collection data...
This comment is hidden because it contains spoiler information about the solution
This solution is built off basic Javascript and clearly shows each actionable step.
+1 don't mutate original array
This comment is hidden because it contains spoiler information about the solution
Agreed. This solution is not as performant as it ought to be. It's using O(n) lookups just to check visited nodes, for example.
How can this be a best practive, or clever, if it walks the entire graph even after it has found a solution?