<?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>Greedy on Jeanphilo Blog</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/greedy/</link><description>Recent content in Greedy on Jeanphilo Blog</description><generator>Hugo -- 0.163.3</generator><language>en-us</language><lastBuildDate>Fri, 03 Jul 2026 00:00:00 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/greedy/index.xml" rel="self" type="application/rss+xml"/><item><title>LeetCode 121: Best Time to Buy and Sell Stock With Greedy</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/greedy/121-best-time-to-buy-and-sell-stock/</link><pubDate>Fri, 03 Jul 2026 00:00:00 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/greedy/121-best-time-to-buy-and-sell-stock/</guid><description>Solve LeetCode 121 in Python by deriving the one-transaction greedy idea from the buy-before-sell constraint, an O(n^2) baseline, and the historical minimum price.</description></item><item><title>LeetCode 55: Jump Game With Farthest Reach Greedy</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/greedy/55-jump-game/</link><pubDate>Fri, 03 Jul 2026 00:00:00 +0800</pubDate><guid>https://shio-chan-dev.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></channel></rss>