Counting Nice Subarrays With Sliding Window And Prefix Sums

The problem requires finding the number of subarrays in an integer array that contain exactly k odd numbers. A sliding window approach with prefix sums efficiently counts these "nice" subarrays.