Check if there exists any sub array with given sum in the array with O(1K) space complexity.

• Use two pointers to traverse the array and maintain a current sum.

• If the current sum is greater than the giv...read more

Given an unsorted array of nonnegative integers, find a continuous subarray which adds to a given number.

Examples :

Input: arr[] = {1, 4, 20, 3, 10, 5}, sum = 33Ouptut: Sum found between indexes 2 an...read more