Two Sum Using Hash Table

Problem

Given an integer array nums and an integer target, return the indices of the two distinct elements whose values sum to target. The input is guaranteed to contain exactly one valid answer, and the same element cannot be used twice.

Constraints

• 2 <= len(nums) <= 10^5
• -10^9 <= nums[i] <= 10^9
• -10^9 <= target <= 10^9
• Exactly one valid answer exists