https://shio-chan-dev.github.io/jeanblog/tags/fast-slow-pointers/Recent content in Fast Slow Pointers on Jeanphilo BlogHugo -- 0.159.2en-usTue, 10 Feb 2026 17:07:38 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/148-sort-list/Tue, 10 Feb 2026 17:07:38 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/148-sort-list/Sort a singly linked list in O(n log n) time using split + recursive merge sort. This guide explains derivation, invariants, engineering mappings, and runnable multi-language implementations.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/142-linked-list-cycle-ii/Tue, 10 Feb 2026 10:47:56 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/142-linked-list-cycle-ii/Return the first node where a singly linked list enters a cycle without modifying the list: use Floyd fast/slow pointers to detect a meeting point, then reset one pointer to head and move both one step to localize the entry in O(n) time and O(1) space.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/141-linked-list-cycle/Tue, 10 Feb 2026 08:55:58 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/141-linked-list-cycle/Detect whether a singly linked list has a cycle using Floyd fast/slow pointers in O(n) time and O(1) extra space, with proof intuition, pitfalls, engineering mapping, and runnable multi-language implementations.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/234-palindrome-linked-list/Mon, 09 Feb 2026 17:38:32 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/234-palindrome-linked-list/Check whether a singly linked list is a palindrome in O(n) time and O(1) extra space: find middle with fast/slow pointers, reverse second half, compare, then restore list structure.