https://jeanphilogong.github.io/jeanblog/tags/leetcode-19/Recent content in LeetCode 19 on Jeanphilo BlogHugo -- 0.168.0en-usMon, 20 Apr 2026 09:36:56 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/19-remove-nth-node-from-end-of-list/Mon, 20 Apr 2026 09:36:56 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/19-remove-nth-node-from-end-of-list/Remove the n-th node from the end of a singly linked list by turning backward counting into a fixed-gap two-pointer problem. This ACERS guide derives the one-pass solution and includes runnable multi-language code.https://jeanphilogong.github.io/jeanblog/alg/leetcode/19-remove-nth-node-from-end-of-list/Thu, 12 Feb 2026 13:50:28 +0800https://jeanphilogong.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.