Find the Largest Almost Missing Integer
Count the length-k windows that contain each value, then keep the largest value that sits in exactly one window.
Count the length-k windows that contain each value, then keep the largest value that sits in exactly one window.