### Single LinkedList - Find LinkedList is circular or not in java

In this Data structures tutorial we will to find out whether our Singly Linked List is circular or not in java.

For finding out whether our Singly Linked List is circular or not in java we will keep two pointers(as used in diagrom below) :
slowPointer: will step over LinkedList by 1 Node.
fastPointer: will step over LinkedList by 2 Node.

Eventually, if Singly LinkedList is circular pointers will meet at certain point.(Let’s call that point meeting point)

Important methods used to find out whether our Singly Linked List is circular or not in java are as follows>
>findCircularOrNot()

Logic explanation to find out whether our Singly Linked List is circular or not in java with diagram >

Let’s see concept of slowPointer and fastPointer in finding out whether Singly LinkedList is circular or not in java with diagram.
Below we have shown meeting point of above circular LinkedList.

Example(considering above diagram)>

NOW WE HAVE TO FIND  OUT  WHETHER LIST IS CIRCULAR OR NOT.
 slowPointer  (steps 1node) fastPointer (steps 2node) start at 11 start at 11 >reaches 22 >reaches 33 >reaches 33 >reaches 55 >reaches 44 >reaches 33 >reaches 55 (meeting point) >reaches 55 (meeting point)

Full Program/SourceCode/Example to find out whether our Singly Linked List is circular or not in java >

Once we have converted our LinkedList into circular one by using  are makeLinkedListCircular() method, we are able to detect so by our algorithm as well.

So we wrote java program to find out whether our Singly Linked List is circular or not in java.

So in this Data structures tutorial we learned important java interview question how to find/detect whether our Singly Linked List is circular or not in java.

Having any doubt? or you you liked the tutorial! Please comment in below section.

Stacks, Queues in java

# Singly LinkedList implementations in java:-

Some of the tricky and interesting Singly LinkedList implementations in java