<?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>Algorithm Walkthrough on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/algorithm-walkthrough/</link><description>Recent content in Algorithm Walkthrough on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>en-us</language><lastBuildDate>Wed, 11 Feb 2026 07:54:26 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/algorithm-walkthrough/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 2: Add Two Numbers from Naive to Optimal Carry Simulation</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/2-add-two-numbers/</link><pubDate>Wed, 11 Feb 2026 07:54:26 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/2-add-two-numbers/</guid><description>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.</description></item></channel></rss>