<?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>LeetCode 143 on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/leetcode-143/</link><description>Recent content in LeetCode 143 on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>en-us</language><lastBuildDate>Tue, 10 Feb 2026 09:57:31 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/leetcode-143/index.xml" rel="self" type="application/rss+xml"/><item><title>Hot100: Reorder List In-Place Split-Reverse-Merge ACERS Guide</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/143-reorder-list/</link><pubDate>Tue, 10 Feb 2026 09:57:31 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/143-reorder-list/</guid><description>Reorder a linked list to L0-&amp;gt;Ln-&amp;gt;L1-&amp;gt;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.</description></item></channel></rss>