Problem: Two Sum

Statement

Given an array of integers nums and an integer target, find two distinct elements in nums whose sum equals target. Return the indices of these two elements.

You may assume that each input has exactly one valid solution. The same element cannot be used twice. The answer may be returned in any order.

Constraints:

• $2 \leq$ nums.length $\leq 10^4$

• ...