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

-1 vote287 views4 answers
Convert kotlin to java online editor
Java
1 vote280 views1 answer
Textarea user select disable java swing
Java
0 vote283 views1 answer
Java format double no decimal places
Java
0 vote282 views1 answer
How to get system date in android
Java
0 vote313 views1 answer
How to change resource color to int color in android
Java
5 votes260 views2 answers
Java create inputstream from string
Java
0 vote249 views1 answer
Kotlin registerForActivityResult
Java
2 votes256 views1 answer
Java load image
Java
0 vote225 views1 answer
Java observable to observer stack overflow
Java
0 vote270 views1 answer
Print 1 to 10 using thread in java
Java