# Check If All The Integers In A Range Are Covered: Practice Notes
Check If All The Integers In A Range Are Covered shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
ranges cover every integer in [left, right] if each x in that interval falls in some [start,end]. Mark coverage with a difference array or, since bounds are small, a boolean array; or sort ranges and sweep.
## 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 + (right-left)).
## Common mistake
Checking that the ranges themselves lie inside [left,right] (the opposite direction) or ignoring holes between ranges.
## 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 assistant for technical interviews.