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 vote358 views3 answers
Java manajro
Java
0 vote360 views2 answers
Bukkit detect block that nowbal hit
Java
1 vote367 views1 answer
Java scanner netLine
Java
0 vote366 views1 answer
Template competitive programming java
Java
1 vote346 views1 answer
Spigot despawn entity
Java
1 vote342 views1 answer
Byte to bufferedimage java
Java
13 votes367 views2 answers
Junit
Java
0 vote329 views1 answer
Void add method using collections
Java
0 vote341 views1 answer
Jlabel icon
Java
2 votes368 views2 answers
How to find out if a directory exists in cpp
Java