https://jeanphilogong.github.io/jeanblog/tags/greedy/Recent content in Greedy on Jeanphilo BlogHugo -- 0.168.0en-usWed, 08 Jul 2026 00:00:00 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/greedy/45-jump-game-ii/Wed, 08 Jul 2026 00:00:00 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/greedy/45-jump-game-ii/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.https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/greedy/435-non-overlapping-intervals/Mon, 06 Jul 2026 00:00:00 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/greedy/435-non-overlapping-intervals/Solve LeetCode 435 in Python by turning minimum removals into maximum kept non-overlapping intervals, then deriving the earliest-ending interval greedy scan.https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/greedy/452-minimum-number-of-arrows-to-burst-balloons/Mon, 06 Jul 2026 00:00:00 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/greedy/452-minimum-number-of-arrows-to-burst-balloons/Solve LeetCode 452 in Python by deriving arrow coverage from shared interval intersections, then compressing the baseline into an earliest-ending arrow_pos greedy scan.https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/greedy/121-best-time-to-buy-and-sell-stock/Fri, 03 Jul 2026 00:00:00 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/greedy/121-best-time-to-buy-and-sell-stock/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.https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/greedy/55-jump-game/Fri, 03 Jul 2026 00:00:00 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/greedy/55-jump-game/Solve LeetCode 55 Jump Game in Python by deriving reachability from a zero barrier, a reachable-array baseline, and the farthest reachable range greedy.https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/53-maximum-subarray/Fri, 23 Jan 2026 13:21:02 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/53-maximum-subarray/Use Kadane's algorithm to compute the maximum subarray sum in O(n). Includes engineering scenarios, pitfalls, and multi-language implementations.https://jeanphilogong.github.io/jeanblog/alg/leetcode/1437-check-if-all-ones-are-at-least-k-places-away/Thu, 22 Jan 2026 10:49:42 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/1437-check-if-all-ones-are-at-least-k-places-away/One-pass check to ensure all 1s are at least k apart. Includes engineering scenarios, pitfalls, and multi-language implementations.