For example:
i/p: 1,2,3,-3,-2,-1
o/p: [2,3], [1,4], [0,5]
You can do a running sum of all the array elements to get the tmp[]:
=> 1 3 6 3 1 0
Now in this array you need to find all duplicates,triplets etc.. All such pairs represent indices of numbers between which the sum of sub-array is zero.
Now to find the duplicates, we can store the tmp[] values as the key in the hashmap with the array index as the values. So, all indices which fall to same key gives us the solution.
i/p: 1,2,3,-3,-2,-1
o/p: [2,3], [1,4], [0,5]
You can do a running sum of all the array elements to get the tmp[]:
=> 1 3 6 3 1 0
Now in this array you need to find all duplicates,triplets etc.. All such pairs represent indices of numbers between which the sum of sub-array is zero.
Now to find the duplicates, we can store the tmp[] values as the key in the hashmap with the array index as the values. So, all indices which fall to same key gives us the solution.
No comments:
Post a Comment