Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to the target.
Example 1:Input: nums = [2,7,11,15], target = 9Output: [0,1]Explanation: Because nums[0] + nums[1] == 9, we return [0, 1].
As always, follow the comments for each line.
In this solution, both time and space complexity is O(n).
From my comments on the code, if you have any questions or comments, feel free to reach out.
