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

[@laptewstein]

"Which is also kind of cool.... if you're a nerd" LOL i loved that

[@kebab4640]

2:00 I like what she said about imperfectionism. She seems wise, I like her.

[@ordead6]

Nice one. Please correct me if I'm wrong, but I guess if you first check if slow or fast pointer are equals 1 in your loop, then you will get a correct answer for: findUltimateOne(10); // true snippet: ``` while(true) { slow = findSquareSum(slow); fast = findSquareSum(findSquareSum(fast)); // first check if any pointers is equals 1. if(slow === 1 || fast === 1) return true; if(slow === fast) return false; } ``` really cool series 👍 thanks

[@amorfati4559]

Nice catch man

[@cssanimationeffects2649]

good one

[@tomerdun]

would be great if you also analyze the runtime of the algos, thanks for the great videos :)

[@hamed4451]

it was great, but i guess there is some mistake , because as you show visually , fast and slow is equall , and then in this condition check for slow === 1 and return true isnt it?