Write a function which determines if there is a cycle in a linked-list.
Anonymous
Use two pointers. One pointer moves to the next node, the other one moves to the next node's next node in every iteration. If these two nodes match at some point, then you have a cycle. If you reach to the end of the linked-list without a match, then there is no cycle.
Check out your Company Bowl for anonymous work chats.