Challenge: Find Two Numbers That Add up to k—Hashing

Statement

Given a list of integers, nums, and an integer target, k, find two numbers in the list that sum up to the target k.

There is exactly one solution for each input, and each element of the list can only be used once in the solution. The order of the returned elements does not matter.

Constraints:

• $2 \leq$ nums.length $\leq10^3$

• $-10^5\leq$ nums[i] $\leq 10^5$

• $-10^5\leq$ k $\leq10^5$

Examples