# Sort Transformed Array: Practice Notes
Sort Transformed Array shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Given a sorted nums, compute a*x^2+b*x+c for each x. The parabola means the transformed array is U-shaped or ∩-shaped. Two-pointer from both ends, always write the larger (if a>=0) or smaller (if a<0) next value into the result from the appropriate end.
## 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
Mapping then sorting in O(n log n), or two-pointing without flipping direction when a is negative.
## 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 multilingual AI interview assistant.