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 vote142 views1 answer
Prevent creating instance of singleton from thread
Java
3 votes136 views1 answer
Reduce in stream in java
Java
1 vote135 views1 answer
Find object with same attribute java stream
Java
0 vote198 views4 answers
How to stop extending jpa repository to every class in java
Java
0 vote136 views1 answer
Get top 3 entries based on values map java
Java
0 vote155 views1 answer
Down casting java
Java
0 vote150 views1 answer
Spring boot init method
Java Spring
0 vote133 views1 answer
Function name in java
Java
0 vote130 views1 answer
Your application is missing a valid safety identifier
Java
1 vote158 views1 answer
Firebase storage dependency
Java