Find subarray with given sum

import java.sql.Array;
import java.util.ArrayList;
import java.util.Arrays;

public class FindSubArr {
    public static void main(String[] args) {
        int [] arr = {0,1,2,3,4,5,6,9,2,1,1,1,10,2,2,2};
        int s = 6 ;
        int [] sub = findLongestSubArray( arr,s);
        System.out.println("longest SubArray Range ==> "+Arrays.toString(sub));

    }

    public static int[] findLongestSubArray(int [] arr, int s){

        int[] result = new int[]{-1};
        int sum=0,left=0,right=0;

        while(right < arr.length){
            sum += arr[right];
            while(left < right && sum > s){
                sum -= arr[left++];
            }
            if(sum == s && (result.length == 1 || result[1] - result[0] < right - left)){
                result = new int[]{left + 1, right +1};
            }
            right++;
        }
        return result;
    }
}

Similar codes

0 vote174 views1 answer
How to read comma separated values in java
Java
2 votes201 views2 answers
Call function after specific time java android
Java
0 vote161 views1 answer
Next method jdbc
Java
1 vote154 views2 answers
On touch listener android
Java
1 vote158 views1 answer
Exponential in java
Java
1 vote157 views1 answer
How to find the largest number in a 2d array java
Java
0 vote205 views1 answer
UserRedirectRequiredException: A redirect is required to get the users approval spring boot 5 security
Java
1 vote181 views2 answers
How to use string variables with an if statement in java
Java
0 vote158 views1 answer
Str.substring last 2 java
Java
15 votes145 views2 answers
Java new string array
Java