Greedy

This section collects Hot100 greedy tutorials, focusing on which local state is enough, why it stays valid while scanning, and how that local choice proves the global answer.

LeetCode 45: Jump Game II From Reachability to Minimum Jumps

Subtitle / Summary Jump Game II is not just reachability. It asks how many coverage layers are needed to reach the last index. Reading time: 8-10 min Tags: Hot100, greedy, array, reachability boundary SEO keywords: LeetCode 45, Jump Game II, greedy, current_end, farthest, minimum jumps Meta description: A pressure-first Python guide to LeetCode 45 that derives the minimum-jump greedy scan from coverage layers. Problem Requirement You are given an integer array nums. ...

LeetCode 435: Non-overlapping Intervals From Minimum Removals to Maximum Kept

Subtitle / Summary Non-overlapping Intervals is easier when you stop asking which interval to delete first. First ask how many intervals can remain. Reading time: 8-10 min Tags: Hot100, greedy, intervals, sorting SEO keywords: LeetCode 435, Non-overlapping Intervals, greedy, interval greedy Meta description: A pressure-first Python guide to LeetCode 435 that derives minimum removals from maximum kept intervals and an earliest-ending greedy scan. Problem Requirement You are given an array of intervals intervals. ...

LeetCode 452: Minimum Number of Arrows From Shared Intersections to Interval Greedy

Subtitle / Summary A single arrow does not belong to one balloon. It belongs to a group of balloon intervals that share at least one x-position. Reading time: 9-11 min Tags: Hot100, greedy, intervals, sorting SEO keywords: LeetCode 452, Minimum Number of Arrows to Burst Balloons, greedy, interval greedy Meta description: A pressure-first Python guide to LeetCode 452 that derives shared intersections, an intersection-scanning baseline, and the final arrow position greedy. Problem Requirement You are given an array points. ...

LeetCode 121: Best Time to Buy and Sell Stock With Greedy

Subtitle / Summary The greedy idea is not “buy low, sell high” as a slogan. The precise rule is: if today is the sell day, the best buy day must be the lowest price before today. Reading time: 8-10 min Tags: Hot100, greedy, array, stock SEO keywords: LeetCode 121, Best Time to Buy and Sell Stock, greedy, historical minimum price Meta description: A pressure-first Python guide to LeetCode 121 that derives brute force, historical minimum price, and the final one-pass greedy solution. Problem Requirement You are given an array prices, where prices[i] is the stock price on day i. ...

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. ...

Recommended Reading Order