Decoding the Fast & Slow Two Pointer Algorithm to Find Cycles in Javascript Part 3 of 3

[@vigneshswamy3058]

Very good content learned

[@amorfati4559]

Here's the naive approach: function hasCycle(arr){ const nodes = {}; let pointer = 0; while(true){ if(arr[pointer + arr[pointer]] < arr.length){ pointer = pointer + arr[pointer]; } else{ pointer = pointer + arr[pointer] - arr.length; } if(arr[pointer] < 0){ let x = 0; for(let i=pointer-1; i>=pointer+arr[pointer]; i--){ x+=arr[i]; } if(x == arr[pointer]*-1){return false;} } if(!nodes[pointer]){ nodes[pointer] = true; } else{ return true; } } } console.log(hasCycle([1, 2, -1, 2, 2])); //true console.log(hasCycle([2, 1, -1, -2])); //false console.log(hasCycle([2, 2, -1, 2])); //true