Given an array of integers, return indices of the two numbers such that they add up to a specific target.
You may assume that each input would have exactly one solution, and you may not use the same element twice.
input: nums = [2, 7, 11, 15], target = 9
output: [0, 1]
Time complexity : O(n)
Space complexity : O(n)