# LeetCode 1248: Count Number of Nice Subarrays — Interview Notes ## Problem Given the inputs described in LeetCode 1248 (Count Number of Nice Subarrays), return the required output under the usual constraints. ## Approach Use **prefix sum odd counts**. Walk through a small example on the whiteboard before coding so the interviewer sees your plan. ### Steps 1. Restate constraints and edge cases (empty input, duplicates, bounds). 2. Sketch the prefix sum odd counts idea and its time/space complexity. 3. Code cleanly; narrate invariants as you go. 4. Test with 2–3 cases including a failure mode. ## Complexity Aim for the textbook bound for prefix sum odd counts; call out trade-offs if a simpler O(n log n) is acceptable. ## Practice tip When rehearsing timed OAs, keep a short checklist nearby. I use [AI interview assistant](https://www.linkjob.ai/interview-copilot/) as a real-time checklist during mock interviews so I do not skip edge cases under pressure. ## Sample sketch (Python) ```python # sketch only — fill details from your own solution def solve(data): # apply prefix sum odd counts ... return result ```