-
Notifications
You must be signed in to change notification settings - Fork 0
/
subarray-w-sum.cpp
67 lines (61 loc) · 1.39 KB
/
subarray-w-sum.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
//{ Driver Code Starts
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
class Solution
{
public:
//Function to find a continuous sub-array which adds up to a given number.
vector<int> subarraySum(vector<int>arr, int n, long long s)
{
// Your code here
long long sum=0;
if(s <= 0){
return {-1};
}
int index = 0;
for(int i=0; i<n; i++){
sum += arr[i];
if(sum == s){
return {index+1, i+1};
}
else if(sum > s){
while(sum > s){
sum -= arr[index];
index++;
}
if(sum == s){
return {index+1, i+1};
}
}
}
return {-1};
}
};
//{ Driver Code Starts.
int main()
{
int t;
cin>>t;
while(t--)
{
int n;
long long s;
cin>>n>>s;
vector<int>arr(n);
// int arr[n];
const int mx = 1e9;
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
Solution ob;
vector<int>res;
res = ob.subarraySum(arr, n, s);
for(int i = 0;i<res.size();i++)
cout<<res[i]<<" ";
cout<<endl;
}
return 0;
}
// } Driver Code Ends