Subarray with given sum

 Given an unsorted array of size N that contains only non-negative integers, find a continuous sub-array which adds to a given number S.

 

Example 1:

Input:
N = 5, S = 12
A[] = {1,2,3,7,5}
Output: 2 4
Explanation: The sum of elements 
from 2nd position to 4th position 
is 12.

 

Example 2:

Input:
N = 10, S = 15
A[] = {1,2,3,4,5,6,7,8,9,10}
Output: 1 5
Explanation: The sum of elements 
from 1st position to 5th position
is 15.

 

Your Task:
You don't need to read input or print anything. The task is to complete the function subarraySum() which takes arr, N and S as input parameters and returns a list containing the starting and ending positions of the first such occurring subarray from the left where sum equals to S. The two indexes in the list should be according to 1-based indexing. If no such subarray is found, return an array consisting only one element that is -1.

 

Expected Time Complexity: O(N)
Expected Auxiliary Space: O(1)

 

class Solution

{

    public:

    //Function to find a continuous sub-array which adds up to a given number.

    vector<int> subarraySum(int arr[], int n, int s)

    {

        // Your code here

        vector <int> res;

        int p1=0;

        int p2=0;

        //int sum=0;

        while(p2<n){

            int sum=0;

        for(int i=p1;i<=p2;i++){

            sum=sum+arr[i];

            

        }

        if(sum==s){

            res.push_back(p1+1);

            res.push_back(p2+1);

            return res;

        }

        else if(sum<s){

            p2++;

        }

        else p1++;

        }

        res.push_back(-1);

        return res;

        

}

};





i

Comments

Popular posts from this blog

Sum of Even Numbers till N

Find the Runner-Up Score!

Print All Substrings