{"id":497,"date":"2021-07-13T16:48:05","date_gmt":"2021-07-13T16:48:05","guid":{"rendered":"https:\/\/www.wikitechy.com\/interview-questions\/?p=497"},"modified":"2021-09-13T06:53:54","modified_gmt":"2021-09-13T06:53:54","slug":"how-to-detect-a-cycle-in-a-linked-list","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/how-to-detect-a-cycle-in-a-linked-list\/","title":{"rendered":"How to detect a cycle in a linked list ?"},"content":{"rendered":"<div class=\"TextHeading\">\n<div class=\"hddn\">\n<h2 id=\"how-to-detect-a-cycle-in-a-linked-list\" class=\"color-pink\" style=\"text-align: justify;\">How to detect a cycle in a linked list ?<\/h2>\n<ul style=\"text-align: justify;\">\n<li>A\u00a0<a href=\"https:\/\/www.wikitechy.com\/technology\/circular-linked-list-introduction-applications\/\" target=\"_blank\" rel=\"noopener\">linked list<\/a>\u00a0is said to contain a cycle if any node is visited more than once.<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<div class=\"ImageContent\" style=\"text-align: justify;\">\n<div class=\"hddn\"><img decoding=\"async\" class=\"img-responsive center-block aligncenter\" src=\"https:\/\/cdn.wikitechy.com\/interview-questions\/data-structure\/how-to-detect-a-cycle-in-a-linked-list.png\" alt=\"How do you detect a cycle in a linked list\" \/><\/div>\n<\/div>\n<div class=\"TextHeading\" style=\"text-align: justify;\">\n<div class=\"hddn\">\n<h2 id=\"method-1-using-hashing\" class=\"color-green\">Method 1 \u2013 Using Hashing<\/h2>\n<\/div>\n<\/div>\n<div class=\"Content\" style=\"text-align: justify;\">\n<div class=\"hddn\">\n<ul>\n<li>Traverse the given list.<\/li>\n<li>Insert each encountered node into a\u00a0<a href=\"https:\/\/www.wikitechy.com\/tutorials\/java\/java-hash-table\" target=\"_blank\" rel=\"noopener\">hash table<\/a>.<\/li>\n<li>If the current already present ,that means the cycle is present or not.<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<div class=\"TextHeading\">\n<div class=\"hddn\">\n<h2 id=\"sample-code\" class=\"color-blue\" style=\"text-align: justify;\">Sample code<\/h2>\n<div class=\"code-embed-wrapper\"> <div class=\"code-embed-infos\"> <\/div> <pre class=\"language-java code-embed-pre line-numbers\"  data-start=\"1\" data-line-offset=\"0\"><code class=\"language-java code-embed-code\">#include <iostream><br\/>#include <unordered_set><br\/>using namespace std;<br\/><br\/>\/\/ Data Structure to store a linked list node<br\/>struct Node<br\/>{<br\/>    int dt;<br\/>    Node* next;<br\/>};<br\/><br\/>\/\/ Helper function to create a new node with the given data and<br\/>\/\/ pushes it onto the front of the list<br\/>void push(Node*& headRef, int dt)<br\/>{<br\/>    \/\/ create a new linked list node from heap<br\/>    Node* newNode = new Node;<br\/><br\/>    newNode->dt = dt;<br\/>    newNode->next = headRef;<br\/>    headRef = newNode;<br\/>}<br\/><br\/>\/\/ Function to detect Cycle in a linked list using Hashing<br\/>bool detectcyc(Node *head)<br\/>{<br\/>    Node *current = head;<br\/>    unordered_set<Node*> set;<br\/><br\/>    \/\/ traverse the list<br\/>    while (current)<br\/>    {<br\/>        \/\/ return false if we already have seen this node before<br\/>        if (set.find(current) != set.end())<br\/>            return true;<br\/><br\/>        \/\/ insert current node into the set<br\/>        set.insert(current);<br\/><br\/>        \/\/ move to the next node<br\/>        current = current->next;<br\/>    }<br\/><br\/>    \/\/ we reach here if list does not contain any cycle<br\/>    return false;<br\/>}<br\/><br\/>\/\/ Detect Cycle in a linked list<br\/>int main()<br\/>{<br\/>    \/\/ input keys<br\/>    int k[] = { 1, 2, 3, 4, 5 };<br\/>    int n = sizeof(k) \/ sizeof(k[0]);<br\/><br\/>    Node* head = nullptr;<br\/>    for (int i = n - 1; i >= 0; i--)<br\/>        push(head, k[i]);<br\/><br\/>    \/\/ insert cycle<br\/>    head->next->next->next->next->next = head->next->next;<br\/><br\/>    if (detectcyc(head))<br\/>        cout << &quot;Cycle Found&quot;;<br\/>    else<br\/>        cout << &quot;No Cycle Found&quot;;<br\/><br\/>    return 0;<br\/>}<\/code><\/pre> <\/div>\n<div class=\"TextHeading\" style=\"text-align: justify;\">\n<div class=\"hddn\">\n<h2 id=\"output\" class=\"color-blue\">Output<\/h2>\n<\/div>\n<\/div>\n<div class=\"Output\" style=\"text-align: justify;\">\n<div class=\"hddn\">\n<figure class=\"highlight\">\n<pre><code class=\"hljs\" data-lang=\"\"><span class=\"nt\">Cycle Found\r\n<\/span><\/code><\/pre>\n<\/figure>\n<\/div>\n<\/div>\n<div class=\"TextHeading\" style=\"text-align: justify;\">\n<div class=\"hddn\">\n<h2 id=\"method-2-floyds-cycle-detection-algorithm\" class=\"color-green\">Method 2 \u2013 Floyd\u2019s Cycle Detection Algorithm<\/h2>\n<\/div>\n<\/div>\n<div class=\"Content\" style=\"text-align: justify;\">\n<div class=\"hddn\">\n<ul>\n<li>Use two pointers, which move through the sequence at different speed.<\/li>\n<li>The fast\u00a0<a href=\"https:\/\/www.wikitechy.com\/tutorials\/c++\/c++-pointers-to-structure\" target=\"_blank\" rel=\"noopener\">pointer<\/a>\u00a0moves twice as quickly as the slow pointer.<\/li>\n<li>Here the distance between the two pointers increased by 1 at each step.<\/li>\n<li>If these\u00a0<a href=\"https:\/\/www.wikitechy.com\/tutorials\/c++\/pointer-to-array-in-c++\" target=\"_blank\" rel=\"noopener\">pointers<\/a>\u00a0meet at same node then there is a loop\u00a0else\u00a0<a href=\"https:\/\/www.wikitechy.com\/technology\/sorted-insert-circular-linked-list-2\/\" target=\"_blank\" rel=\"noopener\">linked list<\/a>\u00a0doesn\u2019t have loop.<\/li>\n<\/ul>\n<\/div>\n<\/div>\n<div class=\"TextHeading\">\n<div class=\"hddn\">\n<h2 id=\"sample-code-2\" class=\"color-blue\" style=\"text-align: justify;\">Sample Code<\/h2>\n<div class=\"code-embed-wrapper\"> <div class=\"code-embed-infos\"> <\/div> <pre class=\"language-java code-embed-pre line-numbers\"  data-start=\"1\" data-line-offset=\"0\"><code class=\"language-java code-embed-code\">#include <iostream><br\/>#include <unordered_set><br\/>using namespace std;<br\/><br\/>\/\/ Data Structure to store a linked list node<br\/>struct Node<br\/>{<br\/>    int dt;<br\/>    Node* next;<br\/>};<br\/><br\/>\/\/ Helper function to create a new node with the given data and<br\/>\/\/ pushes it onto the front of the list<br\/>void push(Node*& headRef, int dt)<br\/>{<br\/>    \/\/ create a new linked list node from heap<br\/>    Node* nNode = new Node;<br\/><br\/>    nNode->dt = dt;<br\/>    nNode->next = headRef;<br\/>    headRef = nNode;<br\/>}<br\/><br\/>\/\/ Function to detect Cycle in a linked list using<br\/>\/\/ Floyd\u2019s Cycle Detection Algorithm<br\/>bool dcycle(Node *head)<br\/>{<br\/>    \/\/ take two pointers - slow and fast<br\/>    Node *slow = head, *fast = head;<br\/><br\/>    while (fast && fast->next)<br\/>    {<br\/>        \/\/ move slow by one pointer<br\/>        slow = slow->next;<br\/><br\/>        \/\/ move fast by two pointers<br\/>        fast = fast->next->next;<br\/><br\/>        \/\/ if they meet any any node, linked list contains a cycle<br\/>        if (slow == fast)<br\/>            return true;<br\/>    }<br\/><br\/>    \/\/ we reach here if slow & fast pointer do not meet<br\/>    return false;<br\/>}<br\/><br\/>\/\/ Detect Cycle in a linked list using Floyd\u2019s Cycle Detection Algorithm<br\/>int main()<br\/>{<br\/>    \/\/ input keys<br\/>    int k[] = { 1, 2, 3, 4, 5 };<br\/>    int n = sizeof(k) \/ sizeof(k[0]);<br\/><br\/>    Node* head = nullptr;<br\/>    for (int i = n - 1; i >= 0; i--)<br\/>        push(head, k[i]);<br\/><br\/>    \/\/ insert cycle<br\/>    head->next->next->next->next->next = head->next->next;<br\/><br\/>    if (dcycle(head))<br\/>        cout << &quot;Cycle Found&quot;;<br\/>    else<br\/>        cout << &quot;No Cycle Found&quot;;<br\/><br\/>    return 0;<br\/>}<\/code><\/pre> <\/div>\n<div class=\"TextHeading\" style=\"text-align: justify;\">\n<div class=\"hddn\">\n<h2 id=\"output-2\" class=\"color-blue\">Output<\/h2>\n<\/div>\n<\/div>\n<div class=\"Output\">\n<div class=\"hddn\">\n<figure class=\"highlight\" style=\"text-align: justify;\">\n<pre><code class=\"hljs\" data-lang=\"\"><span class=\"nt\">Cycle Found<\/span><\/code><\/pre>\n<\/figure>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n","protected":false},"excerpt":{"rendered":"<p>Answer : A linked list is said to contain a cycle &#8230;<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"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":"<!-- This site is optimized with the Yoast SEO plugin v27.6 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>How to detect a cycle in a linked list ? - Data Structure<\/title>\n<meta name=\"description\" content=\"How to detect a cycle in a linked list ? - A linked list is said to contain a cycle if any node is visited more than once.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/how-to-detect-a-cycle-in-a-linked-list\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"How to detect a cycle in a linked list ? - Data Structure\" \/>\n<meta property=\"og:description\" content=\"How to detect a cycle in a linked list ? - A linked list is said to contain a cycle if any node is visited more than once.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/how-to-detect-a-cycle-in-a-linked-list\/\" \/>\n<meta property=\"og:site_name\" content=\"Wikitechy\" \/>\n<meta property=\"article:published_time\" content=\"2021-07-13T16:48:05+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2021-09-13T06:53:54+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/cdn.wikitechy.com\/interview-questions\/data-structure\/how-to-detect-a-cycle-in-a-linked-list.png\" \/>\n<meta name=\"author\" content=\"Editor\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Editor\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/data-structure\\\/how-to-detect-a-cycle-in-a-linked-list\\\/#article\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/data-structure\\\/how-to-detect-a-cycle-in-a-linked-list\\\/\"},\"author\":{\"name\":\"Editor\",\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/#\\\/schema\\\/person\\\/4d5a581fb5470d1560324bddc5e8b757\"},\"headline\":\"How to detect a cycle in a linked list ?\",\"datePublished\":\"2021-07-13T16:48:05+00:00\",\"dateModified\":\"2021-09-13T06:53:54+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/data-structure\\\/how-to-detect-a-cycle-in-a-linked-list\\\/\"},\"wordCount\":871,\"commentCount\":0,\"image\":{\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/data-structure\\\/how-to-detect-a-cycle-in-a-linked-list\\\/#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/cdn.wikitechy.com\\\/interview-questions\\\/data-structure\\\/how-to-detect-a-cycle-in-a-linked-list.png\",\"keywords\":[\"Accenture interview questions and answers\",\"Altimetrik India Pvt Ltd interview questions and answers\",\"Applied Materials interview questions and answers\",\"Bharti Airtel interview questions and answers\",\"BMC Software interview questions and answers\",\"Capgemini interview questions and answers\",\"CASTING NETWORKS INDIA PVT LIMITED interview questions and answers\",\"CGI Group Inc interview questions and answers\",\"Chetu interview questions and answers\",\"Ciena Corporation interview questions and answers\",\"circular linked list java\",\"Collabera Te interview questions and answers\",\"Comodo India Interview Questions and Answers\",\"cycle detection linked list\",\"cycle detection solution\",\"cycle detection solution c++\",\"Dell International Services India Pvt Ltd interview questions and answers\",\"find cycle in linked list\",\"find length of loop in linked list\",\"find loop in linked list\",\"find start of loop in linked list\",\"Flipkart interview questions and answers\",\"floyd's cycle detection algorithm\",\"floyd's cycle finding algorithm\",\"floyd's cycle-finding algorithm c++\",\"Genpact interview questions and answers\",\"given a linked list\",\"Globallogic India Pvt Ltd interview questions and answers\",\"IBM interview questions and answers\",\"Indecomm Global Services interview questions and answers\",\"leetcode sort linked list\",\"link cycle\",\"linked list\",\"linked list cycle\",\"linked list in data structure\",\"linked lists detect a cycle\",\"list cycle\",\"Mphasis interview questions and answers\",\"n'th node from end of linked list\",\"nested loops java\",\"NetApp interview questions and answers\",\"Oracle Corporation interview questions and answers\",\"python linked list cycle\",\"remove loop in linked list\",\"return the node where the cycle begins. if there is no cycle\",\"SAP Labs India Pvt Ltd interview questions and answers\",\"Sapient Consulting Pvt Ltd interview questions and answers\",\"Tech Mahindra interview questions and answers\",\"Tracxn Technologies Pvt Ltd interview questions and answers\",\"UnitedHealth Group interview questions and answers\",\"what is linked list in data structure\",\"Wipro Infotech interview questions and answers\",\"WM Global Technology Services India Pvt.Ltd Limited (WMGTS) interview questions and answers\",\"Xoriant Solutions Pvt Ltd interview questions and answers\",\"Yodlee Infotech Pvt Ltd interview questions and answers\"],\"articleSection\":[\"Data Structure\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/data-structure\\\/how-to-detect-a-cycle-in-a-linked-list\\\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/data-structure\\\/how-to-detect-a-cycle-in-a-linked-list\\\/\",\"url\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/data-structure\\\/how-to-detect-a-cycle-in-a-linked-list\\\/\",\"name\":\"How to detect a cycle in a linked list ? - Data Structure\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/data-structure\\\/how-to-detect-a-cycle-in-a-linked-list\\\/#primaryimage\"},\"image\":{\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/data-structure\\\/how-to-detect-a-cycle-in-a-linked-list\\\/#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/cdn.wikitechy.com\\\/interview-questions\\\/data-structure\\\/how-to-detect-a-cycle-in-a-linked-list.png\",\"datePublished\":\"2021-07-13T16:48:05+00:00\",\"dateModified\":\"2021-09-13T06:53:54+00:00\",\"author\":{\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/#\\\/schema\\\/person\\\/4d5a581fb5470d1560324bddc5e8b757\"},\"description\":\"How to detect a cycle in a linked list ? - A linked list is said to contain a cycle if any node is visited more than once.\",\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/data-structure\\\/how-to-detect-a-cycle-in-a-linked-list\\\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/data-structure\\\/how-to-detect-a-cycle-in-a-linked-list\\\/#primaryimage\",\"url\":\"https:\\\/\\\/cdn.wikitechy.com\\\/interview-questions\\\/data-structure\\\/how-to-detect-a-cycle-in-a-linked-list.png\",\"contentUrl\":\"https:\\\/\\\/cdn.wikitechy.com\\\/interview-questions\\\/data-structure\\\/how-to-detect-a-cycle-in-a-linked-list.png\"},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/#website\",\"url\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/\",\"name\":\"Wikitechy\",\"description\":\"Interview Questions\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Person\",\"@id\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/#\\\/schema\\\/person\\\/4d5a581fb5470d1560324bddc5e8b757\",\"name\":\"Editor\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/e9531079fe7e07841b7b156c04d65e5f39d4adfd18b6ffe3edfff8ca5aab85b5?s=96&d=mm&r=g\",\"url\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/e9531079fe7e07841b7b156c04d65e5f39d4adfd18b6ffe3edfff8ca5aab85b5?s=96&d=mm&r=g\",\"contentUrl\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/e9531079fe7e07841b7b156c04d65e5f39d4adfd18b6ffe3edfff8ca5aab85b5?s=96&d=mm&r=g\",\"caption\":\"Editor\"},\"url\":\"https:\\\/\\\/www.wikitechy.com\\\/interview-questions\\\/author\\\/editor\\\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"How to detect a cycle in a linked list ? - Data Structure","description":"How to detect a cycle in a linked list ? - A linked list is said to contain a cycle if any node is visited more than once.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/how-to-detect-a-cycle-in-a-linked-list\/","og_locale":"en_US","og_type":"article","og_title":"How to detect a cycle in a linked list ? - Data Structure","og_description":"How to detect a cycle in a linked list ? - A linked list is said to contain a cycle if any node is visited more than once.","og_url":"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/how-to-detect-a-cycle-in-a-linked-list\/","og_site_name":"Wikitechy","article_published_time":"2021-07-13T16:48:05+00:00","article_modified_time":"2021-09-13T06:53:54+00:00","og_image":[{"url":"https:\/\/cdn.wikitechy.com\/interview-questions\/data-structure\/how-to-detect-a-cycle-in-a-linked-list.png","type":"","width":"","height":""}],"author":"Editor","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Editor","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/how-to-detect-a-cycle-in-a-linked-list\/#article","isPartOf":{"@id":"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/how-to-detect-a-cycle-in-a-linked-list\/"},"author":{"name":"Editor","@id":"https:\/\/www.wikitechy.com\/interview-questions\/#\/schema\/person\/4d5a581fb5470d1560324bddc5e8b757"},"headline":"How to detect a cycle in a linked list ?","datePublished":"2021-07-13T16:48:05+00:00","dateModified":"2021-09-13T06:53:54+00:00","mainEntityOfPage":{"@id":"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/how-to-detect-a-cycle-in-a-linked-list\/"},"wordCount":871,"commentCount":0,"image":{"@id":"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/how-to-detect-a-cycle-in-a-linked-list\/#primaryimage"},"thumbnailUrl":"https:\/\/cdn.wikitechy.com\/interview-questions\/data-structure\/how-to-detect-a-cycle-in-a-linked-list.png","keywords":["Accenture interview questions and answers","Altimetrik India Pvt Ltd interview questions and answers","Applied Materials interview questions and answers","Bharti Airtel interview questions and answers","BMC Software interview questions and answers","Capgemini interview questions and answers","CASTING NETWORKS INDIA PVT LIMITED interview questions and answers","CGI Group Inc interview questions and answers","Chetu interview questions and answers","Ciena Corporation interview questions and answers","circular linked list java","Collabera Te interview questions and answers","Comodo India Interview Questions and Answers","cycle detection linked list","cycle detection solution","cycle detection solution c++","Dell International Services India Pvt Ltd interview questions and answers","find cycle in linked list","find length of loop in linked list","find loop in linked list","find start of loop in linked list","Flipkart interview questions and answers","floyd's cycle detection algorithm","floyd's cycle finding algorithm","floyd's cycle-finding algorithm c++","Genpact interview questions and answers","given a linked list","Globallogic India Pvt Ltd interview questions and answers","IBM interview questions and answers","Indecomm Global Services interview questions and answers","leetcode sort linked list","link cycle","linked list","linked list cycle","linked list in data structure","linked lists detect a cycle","list cycle","Mphasis interview questions and answers","n'th node from end of linked list","nested loops java","NetApp interview questions and answers","Oracle Corporation interview questions and answers","python linked list cycle","remove loop in linked list","return the node where the cycle begins. if there is no cycle","SAP Labs India Pvt Ltd interview questions and answers","Sapient Consulting Pvt Ltd interview questions and answers","Tech Mahindra interview questions and answers","Tracxn Technologies Pvt Ltd interview questions and answers","UnitedHealth Group interview questions and answers","what is linked list in data structure","Wipro Infotech interview questions and answers","WM Global Technology Services India Pvt.Ltd Limited (WMGTS) interview questions and answers","Xoriant Solutions Pvt Ltd interview questions and answers","Yodlee Infotech Pvt Ltd interview questions and answers"],"articleSection":["Data Structure"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/how-to-detect-a-cycle-in-a-linked-list\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/how-to-detect-a-cycle-in-a-linked-list\/","url":"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/how-to-detect-a-cycle-in-a-linked-list\/","name":"How to detect a cycle in a linked list ? - Data Structure","isPartOf":{"@id":"https:\/\/www.wikitechy.com\/interview-questions\/#website"},"primaryImageOfPage":{"@id":"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/how-to-detect-a-cycle-in-a-linked-list\/#primaryimage"},"image":{"@id":"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/how-to-detect-a-cycle-in-a-linked-list\/#primaryimage"},"thumbnailUrl":"https:\/\/cdn.wikitechy.com\/interview-questions\/data-structure\/how-to-detect-a-cycle-in-a-linked-list.png","datePublished":"2021-07-13T16:48:05+00:00","dateModified":"2021-09-13T06:53:54+00:00","author":{"@id":"https:\/\/www.wikitechy.com\/interview-questions\/#\/schema\/person\/4d5a581fb5470d1560324bddc5e8b757"},"description":"How to detect a cycle in a linked list ? - A linked list is said to contain a cycle if any node is visited more than once.","inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/how-to-detect-a-cycle-in-a-linked-list\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.wikitechy.com\/interview-questions\/data-structure\/how-to-detect-a-cycle-in-a-linked-list\/#primaryimage","url":"https:\/\/cdn.wikitechy.com\/interview-questions\/data-structure\/how-to-detect-a-cycle-in-a-linked-list.png","contentUrl":"https:\/\/cdn.wikitechy.com\/interview-questions\/data-structure\/how-to-detect-a-cycle-in-a-linked-list.png"},{"@type":"WebSite","@id":"https:\/\/www.wikitechy.com\/interview-questions\/#website","url":"https:\/\/www.wikitechy.com\/interview-questions\/","name":"Wikitechy","description":"Interview Questions","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.wikitechy.com\/interview-questions\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Person","@id":"https:\/\/www.wikitechy.com\/interview-questions\/#\/schema\/person\/4d5a581fb5470d1560324bddc5e8b757","name":"Editor","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/secure.gravatar.com\/avatar\/e9531079fe7e07841b7b156c04d65e5f39d4adfd18b6ffe3edfff8ca5aab85b5?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/e9531079fe7e07841b7b156c04d65e5f39d4adfd18b6ffe3edfff8ca5aab85b5?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/e9531079fe7e07841b7b156c04d65e5f39d4adfd18b6ffe3edfff8ca5aab85b5?s=96&d=mm&r=g","caption":"Editor"},"url":"https:\/\/www.wikitechy.com\/interview-questions\/author\/editor\/"}]}},"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/posts\/497","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/comments?post=497"}],"version-history":[{"count":4,"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/posts\/497\/revisions"}],"predecessor-version":[{"id":3507,"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/posts\/497\/revisions\/3507"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/media?parent=497"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/categories?post=497"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/interview-questions\/wp-json\/wp\/v2\/tags?post=497"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}