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 vote290 views1 answer
Java linkedhashset initialize
Java
0 vote319 views1 answer
Java object
Java
5 votes314 views4 answers
File append in java
Java
15 votes324 views2 answers
Throw io exception java
Java
0 vote323 views1 answer
What is getService() in java
Java
21 votes323 views5 answers
Android java string to double
Java
0 vote329 views1 answer
How to get input form combobox java
Java
0 vote364 views1 answer
Java.io.File android.content.Context.getCacheDir()
Java
0 vote307 views1 answer
Jlabel icon
Java
66 votes315 views3 answers
Split String regex java
Java