# Find The Integer Added To Array II: Walkthrough
Find The Integer Added To Array II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Same as I but two elements were removed from the original before adding x. Sort both; try the three candidate alignments of a length-(n-2) window of nums1 against nums2 (drop two from the ends/combo of nums1) and pick the smallest valid x that matches the whole window.
## 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
Assuming the two removed elements are the two largest, which is not always true.
## 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 learn more.