# Check If All As Appears Before All Bs: Study Guide
Check If All As Appears Before All Bs shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Every 'a' must occur before every 'b' — equivalently, there is no 'ba' subsequence, i.e. the string is some a's followed by some b's (no b then a). Return 'ba' not in s.
## 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 equal counts of a and b, or rejecting a string of only a's or only b's.
## 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 interview copilot app.