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 vote194 views1 answer
Make a commet in java
Java
0 vote193 views1 answer
Candies price hackerearth solution in java
Java
1 vote187 views1 answer
Recyclerview snaphelper callbacks android
Java
1 vote197 views2 answers
How to remove all special characters from a string in java
Java
3 votes269 views1 answer
How to change font size in JLabel
Java
0 vote184 views1 answer
Plus one leetcode
Java
0 vote292 views2 answers
No enclosing instance of type Main is accessible. Must qualify the allocation with an enclosing instance of type Main (e.g. x.new A() where x is an instance of Main).
Java
0 vote198 views1 answer
Near "@gmail": syntax error
Java
-1 vote188 views1 answer
Testng with cucumber
Java
2 votes183 views1 answer
Convert hashset to array
Java