1 traversal for Solving Two Pair Sum in O(n)!

via unsplash

Two pairs is commonly found easy interview question. But Could you solve it in one traversal??

Given an array of integers, return indices of the two numbers such that they add up to a specific target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.