https://shio-chan-dev.github.io/jeanblog/tags/linked-list/Recent content in Linked List 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/linked-list/138-copy-list-with-random-pointer/Wed, 11 Feb 2026 07:59:32 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/linked-list/138-copy-list-with-random-pointer/The core of copying a random-pointer list is mapping original node identity to copied node identity, then rebuilding next/random pointers. This article uses the ACERS structure to cover intuition, engineering analogies, pitfalls, and runnable multi-language implementations.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/2-add-two-numbers/Wed, 11 Feb 2026 07:54:26 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/2-add-two-numbers/Add two non-negative integers represented by reverse-order linked lists. This ACERS-style guide explains digit-by-digit carry propagation with engineering mappings and runnable multi-language code.https://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/23-merge-k-sorted-lists/Tue, 10 Feb 2026 17:05:53 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/23-merge-k-sorted-lists/Upgrade from LeetCode 21 to k-way merge: derive why sequential merge degrades, then use divide-and-conquer to reach O(N log k), with heap comparison 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/21-merge-two-sorted-lists/Tue, 10 Feb 2026 10:47:02 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/21-merge-two-sorted-lists/Merge two sorted linked lists in O(m+n) with sentinel node and two pointers, with iterative and recursive comparison, engineering mapping, and runnable multi-language implementations.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/143-reorder-list/Tue, 10 Feb 2026 09:57:31 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/143-reorder-list/Reorder a linked list to L0->Ln->L1->Ln-1... in O(n) time and O(1) extra space using split, reverse, and alternating merge, with derivation, pitfalls, and runnable multi-language implementations.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.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.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/206-reverse-linked-list/Mon, 09 Feb 2026 17:27:59 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/206-reverse-linked-list/Reverse a singly linked list in O(n) time and O(1) extra space with the three-pointer iterative template, with recursive comparison, engineering mapping, and runnable multi-language implementations.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/160-intersection-of-two-linked-lists/Mon, 09 Feb 2026 09:26:37 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/160-intersection-of-two-linked-lists/Find the intersection node of two singly linked lists without modifying structure: two pointers switching heads synchronize in O(m+n) time and O(1) extra space, with derivation, engineering mapping, and multi-language implementations.