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

1 vote354 views4 answers
C code to java converter
Java
9 votes361 views5 answers
String remove duplicate method in java
Java
13 votes388 views6 answers
Android java parse date time
Java
53 votes393 views6 answers
Get last index of array java
Java
1 vote369 views1 answer
Java look and feel system
Java
1 vote365 views1 answer
Spring boot mongodb update subdocument
Java
3 votes374 views1 answer
Android list.length
Java
2 votes358 views1 answer
Java for range loop
Java
0 vote376 views1 answer
Java insert char in string at index
Java
8 votes373 views3 answers
Leap year program in java
Java