# Check If A String Can Break Another String: Practice Notes
Check If A String Can Break Another String shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
s1 can break s2 if there is a permutation of each so that every s1[i] >= s2[i] (or vice versa). Sort both and compare pairwise one way, then the other.
## 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 log n).
## Common mistake
Comparing unsorted strings, or requiring both directions to hold at once.
## 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 https://www.linkjob.ai/.