<?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/tags/greedy/</link><description>Recent content in Greedy on Jeanphilo Blog</description><generator>Hugo -- 0.159.2</generator><language>en-us</language><lastBuildDate>Fri, 23 Jan 2026 13:21:02 +0800</lastBuildDate><atom:link href="https://shio-chan-dev.github.io/jeanblog/tags/greedy/index.xml" rel="self" type="application/rss+xml"/><item><title>Hot100: Maximum Subarray (Kadane O(n) ACERS Guide)</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/53-maximum-subarray/</link><pubDate>Fri, 23 Jan 2026 13:21:02 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/53-maximum-subarray/</guid><description>Use Kadane&amp;#39;s algorithm to compute the maximum subarray sum in O(n). Includes engineering scenarios, pitfalls, and multi-language implementations.</description></item><item><title>LeetCode 1437: Check If All 1's Are at Least K Apart (ACERS Guide)</title><link>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/1437-check-if-all-ones-are-at-least-k-places-away/</link><pubDate>Thu, 22 Jan 2026 10:49:42 +0800</pubDate><guid>https://shio-chan-dev.github.io/jeanblog/alg/leetcode/1437-check-if-all-ones-are-at-least-k-places-away/</guid><description>One-pass check to ensure all 1s are at least k apart. Includes engineering scenarios, pitfalls, and multi-language implementations.</description></item></channel></rss>