Find Indexes of a subarray w.cpp

#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
        
        int i=0,j=0,sum=0;
        
        while(j<n)
        {
            if(i==j)  sum=arr[j];
            else      sum+=arr[j];
            
            
            if(sum>=s)
            {
                while(sum>s)    sum-=arr[i++];
                
                if(i-1==j)      sum=-1;
                 
                if(sum==s)      return{i+1,j+1};
            }
            
            j++;
        }
        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;
}