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

33 votes332 views2 answers
Allow internet permission android
Java
4 votes336 views1 answer
Shift elements in array java
Java
6 votes364 views1 answer
Java int to binary string
Java
0 vote330 views1 answer
Capitalize in controlP5
Java
1 vote354 views1 answer
Java itemstatechanged called twice
Java
14 votes341 views6 answers
Fibonacci
Java
0 vote325 views1 answer
Java data table source tymeLeaf
Java
0 vote310 views1 answer
How to read a table from text file in java
Java
22 votes320 views1 answer
Java exit
Java
4 votes344 views2 answers
Fullscreen activity android
Java