# Inclusion-Exclusion For Counting With Constraints: Study Guide
Inclusion-Exclusion For Counting With Constraints shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Count the union of bad events by alternately adding and subtracting intersections over all subsets.
## 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(2^k) subsets for k constraints.
## Common mistake
Getting the sign wrong for odd versus even subset sizes.
## 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 job interview answers in real time.