https://h30306.github.io/blog/tags/floyds-cycle-finding-algorithm/Recent content in Floyds-Cycle-Finding-Algorithm onHugo -- gohugo.ioenhwork0511@gmail.com (Wei Yi Chung)hwork0511@gmail.com (Wei Yi Chung)© 2026 Wei Yi ChungMon, 14 Nov 2022 00:00:00 +0000https://h30306.github.io/blog/leetcode/leetcode-142/Mon, 14 Nov 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-142/LeetCode 142 note: after fast and slow meet, send one back to head and step both one at a time; they meet again at the cycle entryhttps://h30306.github.io/blog/leetcode/leetcode-202/Sun, 21 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-202/LeetCode 202 note: repeatedly take the sum of squared digits, which reaches 1 or enters a cycle; detect it with a set of seen numbers or fast and slow pointershttps://h30306.github.io/blog/leetcode/leetcode-141/Sat, 20 Aug 2022 00:00:00 +0000hwork0511@gmail.com (Wei Yi Chung)https://h30306.github.io/blog/leetcode/leetcode-141/LeetCode 141 note: Floyd’s cycle detection, fast two steps and slow one; with a cycle they must meet, each advancing from its own position