Two Sum

Given an array of integers nums and an integer target, find the two numbers whose sum equals target and print their indices. Exactly one valid pair exists and the same element cannot be used twice. Print the smaller index first.

2 <= n <= 10^5 -10^9 <= nums[i], target <= 10^9 Exactly one solution exists