Given an array of integers and a value. Find all the pairs that sums up to the value in O(n) time with only one pass over the array. Can you do it efficiently without any space constraint? For example, Given A=[3, 0, -2, 1, 3, 6, 8] and sum = 6 then output pairs are: […]
