Locked

Pass the Dictionary check first

Everything after it builds on dictionaries. Each rep in the check has to be passed without opening the solution. Hints and Basics are fine.

Still to clear · 8 of 8

Continue the check

Preview · where this ladder is heading

Is there a path?

There are n nodes labeled 0..n-1 and a list of undirected edges, each [a, b]. Return True if you can travel from source to destination along edges, otherwise False. A node can always reach itself.

inn = 3, edges = [[0,1],[1,2],[2,0]], source = 0, destination = 2outTrue
inn = 6, edges = [[0,1],[0,2],[3,5],[5,4],[4,3]], source = 0, destination = 5outFalse
inn = 1, edges = [], source = 0, destination = 0outTrue

You can read it now. The editor opens when the check is cleared.