https://shio-chan-dev.github.io/jeanblog/tags/dummy-node/Recent content in Dummy Node on Jeanphilo BlogHugo -- 0.159.2en-usThu, 12 Feb 2026 13:50:28 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/19-remove-nth-node-from-end-of-list/Thu, 12 Feb 2026 13:50:28 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/19-remove-nth-node-from-end-of-list/From naive two-pass traversal to one-pass fast/slow pointers, this ACERS guide explains Remove Nth Node From End of List with correctness intuition, edge cases, engineering mappings, and runnable multi-language code.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/25-reverse-nodes-in-k-group/Tue, 10 Feb 2026 10:25:53 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/25-reverse-nodes-in-k-group/Reverse a linked list in groups of k nodes in-place, leaving the last group unchanged if its size is smaller than k. This guide presents a dummy-node + kth-scan + in-place reversal template in O(n) time and O(1) extra space.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/92-reverse-linked-list-ii/Tue, 10 Feb 2026 09:56:14 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/92-reverse-linked-list-ii/Reverse only the interval [left, right] in a singly linked list using a dummy node and in-place head insertion. O(n) time, O(1) extra space, with derivation, pitfalls, and runnable multi-language implementations.