Longest Subarray Divisible by K with At Most One Negation I
Track, for each remainder, the earliest start of subarrays with and without one negation, so the longest valid window is found in one pass.
Track, for each remainder, the earliest start of subarrays with and without one negation, so the longest valid window is found in one pass.