Greedy (Difference Array / Line Sweep) Pattern Visualizers

The Greedy (Difference Array / Line Sweep) pattern is a recurring algorithmic shape that appears across coding interviews and competitive problems. Use it when the problem geometry matches its trigger conditions — recognizing the pattern collapses what looks like a hard problem into a familiar template. These visualizers trace Greedy (Difference Array / Line Sweep) step-by-step on classics such as Car Pooling, so you can internalize the moves before you ever need them under pressure.