vishalpaalakurthi1) 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
