Skip to main content

๐Ÿฝ๏ธ Greedy

This page provides links to solutions that use the Greedy approach.

Overviewโ€‹

The greedy approach is an algorithmic technique that makes the locally optimal choice at each step with the hope of finding a global optimum. It works by selecting the best option available at the moment without considering future consequences, aiming to reach the overall best solution.

How to Spot These Problemsโ€‹

You can identify greedy problems if the problem requires you to:

  • Find an optimal solution by choosing locally optimal solutions at each step.