NVIDIA Interview Question
Software Engineer / Developers1> Visited flag :-
Have a visited flag in each node of the linked list. Flag it as visited when you reach the node. When you reach a node and the flag is already flagged as visited, then you know there is a loop in the linked list.
2> Fastest method: hare & tortoise
Have 2 pointers to start of the linked list. Increment one pointer by 1 node and the other by 2 nodes. If there's a loop, the 2nd pointer will meet the 1st pointer somewhere. If it does, then you know there's one.
Use hare and tortoise approach to detect loop
- jyoti July 29, 2008