findSubArrayWithSum

#include <iostream>
using namespace std;


void findSubArrayWithSum(int arr[], int length, int sum) {
    int start = 0;
    int currSum = arr[0];
    
    for(int i= 1; i < length ; i ++) {
        currSum += arr[i];
        
        while(currSum > sum) {
            currSum = currSum - arr[start];
            start ++;
        }
        
        if (currSum == sum) {
            cout << "indexes between : " << start << "," << i;
            return;
        }
    }
    
    cout << "Subarray not found";
}

int main() {
    cout << "Hello World!";
    int arr[] = {1,4,20,3,10,5};
    int len = sizeof(arr) / sizeof(arr[0]);
    cout << "length : " << len << endl;
    findSubArrayWithSum(arr, len, 33);
     return 0;
}