# Find If Array Can Be Sorted: Walkthrough
Find If Array Can Be Sorted shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
You may swap adjacent elements only when they have the same popcount. Partition nums into segments of equal popcount; you can freely sort inside a segment. The array is sortable iff concatenating those locally-sorted segments is fully sorted (equivalently: max of each segment <= min of the next).
## 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) or O(n) after comparing neighboring segments.
## Common mistake
Allowing swaps across different popcounts, or sorting the whole array without the popcount constraint.
## 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 Linkjob AI.