Circluar linkedlist

#1

in this question , how to make circular linked list

#2

@Ajitverma1503 In this question you first need to create the circular linked list. Then break it from the point where it forms the loop. Use the Floyd Cycle detection algo as taught in the course.
After breaking the loop you have to print the resulting linked list.
Say If INPUT IS 1 2 3 4 5 2 3 -1
form a linked list 1->2->3->4>5 then you see that 2 has already been visited , so connect the next pointer of 5 to 2. This way you have created the circular linked list . After that just detect the cycle, remove the cycle, print the new linked list.

#3

my question is how to create a circular linked list like 1 2 3 4 5 2 3

#4

@Ajitverma1503 I have explained that above.
Say If INPUT IS 1 2 3 4 5 2 3 -1
form a linked list 1->2->3->4>5 then you see that 2 has already been visited (So for this you can maintain a map or a visited array…whenever you see that a node is already visited, connect next pointer of previous node to that node.) so connect the next pointer of 5 to 2. This way you have created the circular linked list .