Problem 632 · Hard

Smallest Range Covering Elements from K Lists

Advance the list holding the smallest value; every window must still touch every list.

Open the interactive visualisation