# Subarrays With K Different Integers: Practice Notes
Subarrays With K Different Integers shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
At-most(k) minus at-most(k-1) with a sliding window that counts distinct integers.
## 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
Trying to maintain exactly k distinct types in one window without the at-most trick.
## 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 help for online coding assessments.