This is a submission for DEV Computer Science Challenge v24.06.12: One Byte Explainer.

Explainer

A greedy algorithm is like a kid in a candy store: it grabs the best candy (local optimum) it sees without thinking ahead, hoping to end up with the most candy (global optimum). It’s used in problems like finding the shortest path or scheduling tasks.

Additional Context

Greedy but effective