<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Fast and Slow Pointers on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/fast-and-slow-pointers/</link><description>Recent content in Fast and Slow Pointers on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>en-us</language><lastBuildDate>Thu, 12 Feb 2026 13:50:28 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/fast-and-slow-pointers/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 19: Remove Nth Node From End of List (One-pass Two Pointers) ACERS Guide</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/19-remove-nth-node-from-end-of-list/</link><pubDate>Thu, 12 Feb 2026 13:50:28 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/19-remove-nth-node-from-end-of-list/</guid><description>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.</description></item></channel></rss>