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

3 votes192 views1 answer
Java write string
Java
0 vote254 views1 answer
They say that they have to create an instance to their application. What does it mean?
Java
2 votes250 views1 answer
Greater than sign in java
Java
0 vote249 views1 answer
Timestamp with zone java
Java
1 vote205 views6 answers
Kotlin to java converter
Java
0 vote252 views1 answer
HorizontalAlignment center jlabel
Java
4 votes247 views3 answers
Spigot scheduler
Java
49 votes204 views4 answers
Java find last element in array
Java
0 vote188 views1 answer
Get runtime java
Java
0 vote199 views2 answers
How to remove all components from layeredPane java
Java