# Count Number Of Nice Subarrays: Interview Notes
Count Number Of Nice Subarrays shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A nice subarray has exactly k odds: map odds to 1 and evens to 0, then the at-most(k) minus at-most(k-1) window count (or prefix odds).
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (string DP, sliding window, trie, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Counting subarrays whose length is k rather than whose odd-count is k.
## Practice tip
Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at this tool.