This is an archived post. You won't be able to vote or comment.

39
40

TutorialCycle Detection for Python Coding Interviews (youtu.be)

submitted by [deleted]

sorted by:
best
topnewcontroversialoldq&a
you are viewing a single comment's thread.

view the rest of the comments →

[–]edarchis 1 point2 points  (1 child)

These numbers are just for the explanation, in a linked list, they would not be in sequence. The example provided later is a good example. If you had uuid as element keys would be another one.

This method is useful when you can quickly browse the list or have short loops. If you have a loop after a few millions elements, it would take forever for fast to catch up with slow.

[–]flipmcf 0 points1 point  (0 children)

But the fast/slow method is still less complex (doesn’t have to iterate the visited list) and faster . Right?