Problem 3567 · Medium
For each k by k window, sort its distinct values and keep the smallest gap between neighbors.
Open the interactive visualisation