Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target.

Each input has exactly one solution, and the same element may not be used twice.

The answer may be returned in any order.

Example 1:

Input:  nums = [2, 7, 11, 15], target = 9
Output: [0, 1]
Explanation: nums[0] + nums[1] == 2 + 7 == 9.

Constraints:

• 2 <= len(nums) <= 10^5
• -10^9 <= nums[i] <= 10^9
• -10^9 <= target <= 10^9