#include using namespace std; /* Link list node */ struct Node { int data; struct Node* next; Node(int data) { this->data = data; next = NULL; } }; struct LinkedList { Node *head; LinkedList() { head = NULL; } void createLoop() { Node * temp = head->next->next; Node * last = head; while (last->next) { last = last->next; } last->next = temp; } Node * findLoop() { Node * slow = head; Node * fast = head; while (slow && fast && fast->next) { slow = slow->next; fast = fast->next->next; if (fast == slow) return fast; } return NULL; } void removeLoop(Node * p) { if (p != NULL) { Node * q = head; while (p->next != q->next) { p = p->next; q = q->next; } p->next = NULL; } } void reverse() { Node *current = head; Node *prev = NULL, *next = NULL; while (current != NULL) { // Store next next = current->next; // Reverse current node's pointer current->next = prev; // Move pointers one position ahead. prev = current; current = next; } head = prev; } void print() { struct Node *temp = head; while (temp != NULL) { cout << temp->data << " "; temp = temp->next; } cout << endl; } void push(int data) { Node *temp = new Node(data); temp->next = head; head = temp; } }; int main() { LinkedList list; list.push(10); list.push(20); list.push(30); list.push(40); list.push(50); list.push(60); cout << "Given linked list\n"; list.print(); list.reverse(); cout << "\nReversed Linked list \n"; list.print(); list.createLoop(); cout << "\nLoop created: head->next->next->next->next->next = head->next->next" << endl << endl; Node * meetPoint = list.findLoop(); if (meetPoint) { cout << "Loop founded at meetPoint: " << meetPoint << ", with data: " << meetPoint->data << endl << endl; list.removeLoop(meetPoint); cout << "List after removing a loop" << endl; list.print(); } return 0; }

Linked List reversing and find_remove loops