<?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 on Jeanphilo Blog</title><link>https://jeanphilogong.github.io/jeanblog/tags/reachability/</link><description>Recent content in Reachability on Jeanphilo Blog</description><generator>Hugo -- 0.168.0</generator><language>en-us</language><lastBuildDate>Fri, 03 Jul 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://jeanphilogong.github.io/jeanblog/tags/reachability/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 55: Jump Game With Farthest Reach Greedy</title><link>https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/greedy/55-jump-game/</link><pubDate>Fri, 03 Jul 2026 00:00:00 +0800</pubDate><guid>https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/greedy/55-jump-game/</guid><description>Solve LeetCode 55 Jump Game in Python by deriving reachability from a zero barrier, a reachable-array baseline, and the farthest reachable range greedy.</description></item><item><title>k-hop and Reachability Queries: BFS Limits, Reachability Indexes, and 2-hop Labeling ACERS Analysis</title><link>https://jeanphilogong.github.io/jeanblog/dev/algorithm/graph/30-k-hop-reachability-and-reach-index/</link><pubDate>Mon, 09 Feb 2026 09:52:17 +0800</pubDate><guid>https://jeanphilogong.github.io/jeanblog/dev/algorithm/graph/30-k-hop-reachability-and-reach-index/</guid><description>A systematic engineering guide to k-hop and reachability queries: BFS+hop limits, why full transitive closure is usually not maintained, and practical bitmap/2-hop reach-index strategies with runnable multi-language code.</description></item></channel></rss>