We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
boolhas_cycle(Node*head){Node*slow=head;//slow pointerNode*fast=head;//fast pointerboolcycle=false;while(fast!=NULL){slow=slow->next;// goes slowerfast=fast->next;// goes fasterfast=fast->next;if(slow==fast)// if they meet => cycle.. easy{cycle=true;break;}}returncycle;// Complete this function// Do not write the main method}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Cycle Detection
You are viewing a single comment's thread. Return to all comments →
Simple C++ solution.