# Find Original Array From Doubled Array: Walkthrough
Find Original Array From Doubled Array shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
changed is a shuffled concatenation of an array and that array with every element doubled. Sort, then greedily match each unused smallest value x with 2x via a frequency map (skip values already consumed as someone else's double).
## 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
Matching from the largest value, which fails when x and 2x and 4x interleave, or pairing a value with itself when 2x==x only for 0 (handle zeros in pairs).
## 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 try it free.