# Check If The Sentence Is Pangram: Interview Notes

Check If The Sentence Is Pangram shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A pangram contains every letter a-z at least once. Put characters in a set (ignore case if needed) and check size == 26.

## 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 each letter exactly once, or forgetting letters that appear later in the sentence.

## 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 this tool.