Leetcode 1248. Count Number of Nice Subarrays

Count the number of contiguous subarrays that contain exactly k odd numbers in an integer array. The core challenge is to do this in linear time by using parity prefix counts (or by counting even-number gaps between odds) to compute how many subarrays end at each position.