given an array of integers and a number , return the two index whose sum is equal to number.

ex: arr= [3,2,1,5,4,0,7] and num = 11
output : [4,6] as arr[4]+arr[6] = 11

not sure if its possible to do in O(n) time complexity and O(1) space complexity