public void findSubArray(int[] arrA, int Sum) {
		int currSum = 0;
		int start = 0;
		// idea is to keep adding all the elements to the currSum
		// keep checking if the currSum<Sum
		// if currSum gets greater than the Sum then start reducing the currSum
		// from the beginning of the array using "start"
		// if any time currSum=Sum, Stop and return
		for (int i = 0; i <= arrA.length; i++) {

			while (currSum > Sum) {
				// System.out.println(currSum + " reducing");
				currSum = currSum - arrA[start++];
				// System.out.println(currSum + " reduced");
			}
			if (currSum == Sum) {
				System.out.println(Sum + " is found between indexes " + start
						+ " and " + (i - 1));
				// print the exact elements
				System.out.print("And Elements are : ");
				for (int j = start; j <= i - 1; j++) {
					System.out.print(" " + arrA[j]);
				}
				return;
			}
			if (i < arrA.length)
				currSum = currSum + arrA[i];
			// System.out.println(currSum);
		}

		// if we have reached that means that we have not found the subarray
		// with summation equals to Sum
		System.out.println("No subarray is found with sum equals to " + Sum);
	}