# Find The Integer Added To Array I: Practice Notes

Find The Integer Added To Array I shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

nums2 is nums1 with every element increased by a secret x (possibly shuffled). x is min(nums2)-min(nums1) (or any matching after sort: sorted2[i]-sorted1[i]).

## 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

XORing the arrays (that solves a different pairing problem) or assuming they are already aligned by index.

## 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/.