Fixed-Size Window Target Counting

You are given an array of integers, a window size k, and a target value. The interview starts with finding every length-k sliding window that contains the target at least once, then asks for the length-k window where the target appears the most times.