Problem 1708 · Easy

Largest Subarray Length K

Find the lexicographically largest contiguous window of length k. The visual slides a window of length k across the array and highlights the largest candidate.

Open the interactive visualisation