Two Sum — Hash Map Practice

Given a list of integers nums and an integer target, return the indices of two distinct elements whose values add up to target.

You may assume every input has exactly one valid pair of indices. You may not use the same element twice. Return the two indices in either order.

Constraints:

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

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

Example 2:
Input: nums = [3, 2, 4], target = 6
Output: [1, 2]