Problem Statement

Two Sum Given an array of integers nums and an integer target , find two entries whose values add up to target and report their indices. Assume every input has exactly one valid solution, and the same array element cannot be used twice. Return the answer in increasing order. Example Input: nums = [2, 7, 11, 15], target = 9\nOutput: 0 1 Constraints 2 <= nums.length <= 10^4 -10^9 <= nums[i] <= 10^9