LeetCode 55: Jump Game With Farthest Reach Greedy

Subtitle / Summary Jump Game is not about guessing one path. It is about maintaining how far all reachable positions can cover. Reading time: 8-10 min Tags: Hot100, greedy, array, reachability SEO keywords: LeetCode 55, Jump Game, greedy, farthest reach, reachability Meta description: A pressure-first Python guide to LeetCode 55 that derives a reachable-array baseline and compresses it into the farthest reachable range. Problem Requirement You are given an integer array nums. ...

July 3, 2026 · 6 min · map[name:Jeanphilo]

k-hop and Reachability Queries: BFS Limits, Reachability Indexes, and 2-hop Labeling ACERS Analysis

This article walks through k-hop and reachability queries in practice: BFS+hop limits, transitive-closure tradeoffs, and engineering rollout paths for bitmap indexes and 2-hop labeling.

February 9, 2026 · 12 min · map[name:Jeanphilo]