# Jewels And Stones: Practice Notes
Jewels And Stones shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
How many stones are also jewels? Put jewels in a set and count stones that appear in it.
## 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+m).
## Common mistake
A nested loop for every stone against every jewel without mentioning it (fine for tiny n) or counting unique stone types rather than occurrences.
## 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.