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 vote355 views1 answer
Java lambda expression in priorityqueue
Java
0 vote332 views1 answer
Minecraft bukkit coding player sharing variable
Java
2 votes333 views1 answer
Convert hashset to array
Java
1 vote331 views1 answer
Android navigation bar color change
Java
0 vote374 views1 answer
Java swap variables
Java
30 votes353 views3 answers
String to Char array
Java
1 vote353 views1 answer
Calendar.year java
Java
1 vote354 views1 answer
Java intercept ctrl c
Java
0 vote404 views1 answer
Comparable interface java
Java
0 vote347 views1 answer
Java dictionary array initialization
Java