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 vote333 views4 answers
How to use old android studio project
Java
5 votes335 views2 answers
Write file from a specific location in java
Java
4 votes475 views1 answer
Context path spring boot
Java Spring
1 vote339 views1 answer
Java boolean 2d array
Java
1 vote342 views1 answer
Android temporal navigation
Java
0 vote341 views1 answer
Get sum of array and return string
Java
0 vote342 views1 answer
Lcm of two large positive integers java
Java
1 vote336 views1 answer
Java.io.IOException: Can't read fonts
Java
50 votes336 views6 answers
Char array to string in java
Java
0 vote323 views1 answer
Do i have to import files from the same package in java
Java