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

2 votes243 views2 answers
Compare two character alphabetically java
Java
2 votes253 views1 answer
Spigot actionbar
Java
-4 votes260 views2 answers
Spring security logging
Java Spring
1 vote237 views1 answer
Processing draw circle
Java
7 votes238 views3 answers
Sorting list in java
Java
0 vote226 views1 answer
Java jackson optional
Java
0 vote234 views1 answer
Get generic type of class at runtime
Java
0 vote275 views1 answer
Put in spring rest api
Java Spring
3 votes222 views1 answer
How to add negative random numbers in java
Java
0 vote242 views1 answer
Mettre caractère de string en majuscule java
Java