Two sum

Given an integer array and a target, return the indices of the two different elements that add up to the target; exactly one such pair exists. Then solve it without a hash map (for example by sorting indices and walking two pointers) and compare the costs.