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

2 votes146 views2 answers
Clear an array list in java
Java
36 votes157 views4 answers
Random number in range java
Java
0 vote154 views1 answer
Remove java ubuntu 20.04 stackoverflow
Java
0 vote174 views1 answer
Crit chance in java
Java
13 votes154 views2 answers
Android cardview dependency
Java
4 votes152 views1 answer
How to check if recyclerview is empty
Java
1 vote162 views1 answer
L,og in android studio
Java
-1 vote144 views1 answer
Java in 5 minutes
Java
0 vote109 views1 answer
How to get server port in java
Java
0 vote153 views1 answer
Java swing get resource from image
Java