Sample Code<\/h2>\n

<\/div>

#include <iostream>#include <unordered_set>using namespace std;\/\/ Data Structure to store a linked list nodestruct Node{    int dt;    Node* next;};\/\/ Helper function to create a new node with the given data and\/\/ pushes it onto the front of the listvoid push(Node*& headRef, int dt){    \/\/ create a new linked list node from heap    Node* nNode = new Node;    nNode->dt = dt;    nNode->next = headRef;    headRef = nNode;}\/\/ Function to detect Cycle in a linked list using\/\/ Floyd\u2019s Cycle Detection Algorithmbool dcycle(Node *head){    \/\/ take two pointers - slow and fast    Node *slow = head, *fast = head;    while (fast && fast->next)    {        \/\/ move slow by one pointer        slow = slow->next;        \/\/ move fast by two pointers        fast = fast->next->next;        \/\/ if they meet any any node, linked list contains a cycle        if (slow == fast)            return true;    }    \/\/ we reach here if slow & fast pointer do not meet    return false;}\/\/ Detect Cycle in a linked list using Floyd\u2019s Cycle Detection Algorithmint main(){    \/\/ input keys    int k[] = { 1, 2, 3, 4, 5 };    int n = sizeof(k) \/ sizeof(k[0]);    Node* head = nullptr;    for (int i = n - 1; i >= 0; i--)        push(head, k[i]);    \/\/ insert cycle    head->next->next->next->next->next = head->next->next;    if (dcycle(head))        cout << "Cycle Found";    else        cout << "No Cycle Found";    return 0;}<\/code><\/pre> <\/div>\n
\n
\n
Output<\/h2>\n<\/div>\n<\/div>\n
\n
\n
\n
Cycle Found<\/span><\/code><\/pre>\n<\/figure>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"
Answer : A linked list is said to contain a cycle …<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"passster_activate_protection":false,"passster_protect_child_pages":"","passster_protection_type":"password","passster_password":"","passster_activate_overwrite_defaults":"","passster_headline":"","passster_instruction":"","passster_placeholder":"","passster_button":"","passster_id":"","passster_activate_misc_settings":"","passster_redirect_url":"","passster_hide":"no","passster_area_shortcode":"","gtb_hide_title":false,"gtb_wrap_title":false,"gtb_class_title":"","gtb_remove_headerfooter":false,"footnotes":""},"categories":[3028],"tags":[195,971,491,221,368,203,199,214,198,363,3487,3057,15908,3482,3481,3483,205,3491,3191,3489,3186,222,3187,3472,3484,484,3473,3054,196,212,3480,3488,3485,3477,3182,3471,3490,207,3190,3486,366,204,3476,3478,3474,206,972,200,3055,197,3426,968,3056,285,969],"class_list":["post-497","post","type-post","status-publish","format-standard","hentry","category-data-structure","tag-accenture-interview-questions-and-answers","tag-altimetrik-india-pvt-ltd-interview-questions-and-answers","tag-applied-materials-interview-questions-and-answers","tag-bharti-airtel-interview-questions-and-answers","tag-bmc-software-interview-questions-and-answers","tag-capgemini-interview-questions-and-answers","tag-casting-networks-india-pvt-limited-interview-questions-and-answers","tag-cgi-group-inc-interview-questions-and-answers","tag-chetu-interview-questions-and-answers","tag-ciena-corporation-interview-questions-and-answers","tag-circular-linked-list-java","tag-collabera-te-interview-questions-and-answers","tag-comodo-india-interview-questions-and-answers","tag-cycle-detection-linked-list","tag-cycle-detection-solution","tag-cycle-detection-solution-c","tag-dell-international-services-india-pvt-ltd-interview-questions-and-answers","tag-find-cycle-in-linked-list","tag-find-length-of-loop-in-linked-list","tag-find-loop-in-linked-list","tag-find-start-of-loop-in-linked-list","tag-flipkart-interview-questions-and-answers","tag-floyds-cycle-detection-algorithm","tag-floyds-cycle-finding-algorithm","tag-floyds-cycle-finding-algorithm-c","tag-genpact-interview-questions-and-answers","tag-given-a-linked-list","tag-globallogic-india-pvt-ltd-interview-questions-and-answers","tag-ibm-interview-questions-and-answers","tag-indecomm-global-services-interview-questions-and-answers","tag-leetcode-sort-linked-list","tag-link-cycle","tag-linked-list","tag-linked-list-cycle","tag-linked-list-in-data-structure","tag-linked-lists-detect-a-cycle","tag-list-cycle","tag-mphasis-interview-questions-and-answers","tag-nth-node-from-end-of-linked-list","tag-nested-loops-java","tag-netapp-interview-questions-and-answers","tag-oracle-corporation-interview-questions-and-answers","tag-python-linked-list-cycle","tag-remove-loop-in-linked-list","tag-return-the-node-where-the-cycle-begins-if-there-is-no-cycle","tag-sap-labs-india-pvt-ltd-interview-questions-and-answers","tag-sapient-consulting-pvt-ltd-interview-questions-and-answers","tag-tech-mahindra-interview-questions-and-answers","tag-tracxn-technologies-pvt-ltd-interview-questions-and-answers","tag-unitedhealth-group-interview-questions-and-answers","tag-what-is-linked-list-in-data-structure","tag-wipro-infotech-interview-questions-and-answers","tag-wm-global-technology-services-india-pvt-ltd-limited-wmgts-interview-questions-and-answers","tag-xoriant-solutions-pvt-ltd-interview-questions-and-answers","tag-yodlee-infotech-pvt-ltd-interview-questions-and-answers"],"yoast_head":"\n