<?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>Reachability Boundary on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/tags/reachability-boundary/</link><description>Recent content in Reachability Boundary on Jeanphilo Blog</description><generator>Hugo -- 0.165.0</generator><language>en-us</language><lastBuildDate>Wed, 08 Jul 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/reachability-boundary/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 45: Jump Game II From Reachability to Minimum Jumps</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/greedy/45-jump-game-ii/</link><pubDate>Wed, 08 Jul 2026 00:00:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/greedy/45-jump-game-ii/</guid><description>Solve LeetCode 45 Jump Game II in Python by upgrading the farthest reach idea from LeetCode 55 into a minimum-jump layer boundary with current_end and farthest.</description></item></channel></rss>