Greedy

LeetCode problem #134

LeetCode problem #1300

Master greedy algorithms by making locally optimal choices to find globally optimal solutions.

Find the maximum profit from buying and selling stock with at most one transaction

Distribute the minimum number of candies to children in a line such that each child gets at least one and children with higher ratings get more than their neighbors

Find the minimum number of coins needed to make a given amount

Connect ropes with minimum cost using greedy approach with heap

Find furthest building reachable using optimal allocation of bricks and ladders

Determine if you can reach the last index of an array where each element represents the maximum jump length from that position

Given an array where each element represents the maximum jump length, find the minimum number of jumps to reach the last index

Maximize array sum by flipping signs of k elements using greedy heap approach

Find the contiguous subarray with maximum sum using Kadane's algorithm

Find minimum number of meeting rooms required using heap

Given an array of intervals where intervals[i] = [start_i, end_i], merge all overlapping intervals and return an array of the non-overlapping intervals that cover all the intervals in the input.

Find minimum insertions needed to balance parentheses string

Given arrival and departure times of trains at a station, find the minimum number of platforms required so that no train is kept waiting

Find minimum refueling stops to reach target using greedy max-heap approach

Learn what a minimum spanning tree is + MST algorithm steps. Kruskal (Union-Find) O(E log E) vs Prim (heap) O(E log V). Practice now.

Find minimum removals to reduce array size by half using greedy heap approach

Remove k digits from a number to make it as small as possible

Solve LC 767 with a greedy priority queue (max-heap). Learn the maxFreq ≤ ceil(n/2) condition + proof. O(n log k). Practice now.

Find the minimum number of intervals the CPU will take to finish all given tasks with a cooldown period between identical tasks

Schedule tasks with cooling period using greedy approach with heap