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

4 votes211 views2 answers
Java go troght loop object
Java
1 vote156 views1 answer
Java jlabel border
Java
0 vote192 views1 answer
Reverse sentence in java
Java
11 votes201 views3 answers
Java close jframe
Java
0 vote196 views1 answer
Get value from Spring application.properties
Java Spring
5 votes158 views2 answers
Java double format
Java
0 vote181 views2 answers
How do i use weather api on my website netbeans
Java
0 vote221 views1 answer
How to generate output in various colors in java
Java
0 vote176 views1 answer
Url encode not working spring boot oauth2
Java
0 vote162 views1 answer
Parentheses in java
Java