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 vote277 views1 answer
How to find mongo java driver version
Java
16 votes318 views5 answers
How to uppercase the first letter of a string in java
Java
0 vote286 views1 answer
Java code for scientific calculator GUI
Java
6 votes277 views3 answers
JOptionpane
Java
2 votes276 views2 answers
Install java with brew
Java
0 vote329 views1 answer
Java startswith regex
Java
0 vote295 views2 answers
Lcm of two number in java
Java
0 vote281 views1 answer
Android: remove shadow from bottom navigation
Java
1 vote291 views1 answer
Range of int in java
Java
3 votes277 views2 answers
Xml definition file for spring
Java