<?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>Template on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/template/</link><description>Recent content in Template on Jeanphilo Blog</description><generator>Hugo -- 0.163.3</generator><language>en-us</language><lastBuildDate>Tue, 30 Jun 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/template/index.xml" rel="self" type="application/rss+xml"/><item><title>Union-Find Template: Derive find / union / count</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/union-find/union-find-template/</link><pubDate>Tue, 30 Jun 2026 00:00:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/union-find/union-find-template/</guid><description>Derive the Python Union-Find template from a small set-merging task: parent, find, union, count, connected, and path compression.</description></item><item><title>Trie Template Guide: Node Fields, Child Traversal, and Loop Invariants</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/trie/trie-template/</link><pubDate>Thu, 25 Jun 2026 13:58:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/trie/trie-template/</guid><description>Build a Python Trie template from first principles: derive children, is_end, insert/search traversal, prefix lookup, and the loop invariants behind each method.</description></item></channel></rss>