How to detect loop in linkedlist?

#interview #tutorial #datastructures #oops

1) Two pointers (each node is assigned with an address)

2) Traverse through each node till end , tracking visited node using visited flag.

If you find node that is already visited, then there is a loop in LinkedList and if you reach till end while traversing then there is no loop in LinkedList

Top comments (0)

Python code that generates a stock price chart for the last n days.

Dmitry Romanoff - Oct 21

Creating a Global .gitignore File as an Extra Line of Defense Against Bad Commits

JT Ziolo - Oct 12

What is the difference between forEach and map in streams?

realNameHidden - Nov 10

Fullstack app: Deploying the Fullstack Application on Render with Docker

Matheus Bernardes Spilari - Oct 7

DEV Community