Subarrays with k odds
Given an integer array a and an integer k, return the number of contiguous subarrays that contain exactly k odd numbers. The array may have length 1; k is non-negative.
Implement
count_nice_subarrays(a: list[int], k: int) → intExamples
in
[[1,1,2,1,1],3]out2What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 25 min
solution.py
InputExpectedGot
[[1,1,2,1,1],3]2not run yetsample