Problem: Two Sum
Given two inputs: an integer array nums and an integer value target. Implement a function twoSum such that it returns the indicies of the two elements in nums that sum up to the target.
Input Constraints: Length of nums will be between $2$ and $10^5$.
Output Constraints: There is