Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Minimum Operations to Reduce X to Zero
Coding · Array · Binary Search · Hash Table
- Maximum Number of Visible Points
Coding · Array · Geometry · Math
- Number of Flowers in Full Bloom
Coding · Array · Binary Search · Hash Table
- Contiguous Array
Coding · Array · Hash Table · Prefix Sum
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1248. Count Number of Nice Subarrays
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
TikTok
Count Number of Nice Subarrays
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 52.7. This is not an interview probability.
View source