# Count Number Of Beautiful Subarrays: Practice Notes
Count Number Of Beautiful Subarrays shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A subarray is beautiful when every bit appears an even number of times, i.e. the XOR is 0. Prefix XOR frequencies count them.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.
## Complexity
O(n).
## Common mistake
Requiring every bit to appear exactly twice instead of an even count.
## 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 AI interview helper that uses your resume.