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

11 votes297 views4 answers
Circular imageview android
Java
0 vote284 views1 answer
Excel data formatter in java
Java
87 votes333 views6 answers
Hello world in java
Java
0 vote325 views1 answer
A Queue after the following operations: enqueue(3) enqueue(4) enqueue(2) dequeue() enqueue(1) enqueue(1) enqueue(2) dequeue()
Java
1 vote312 views1 answer
Command line is too long. Shorten command line for Application or also for Application default configuration?
Java
1 vote298 views1 answer
Menghitung luas lingkaran
Java
0 vote718 views1 answer
Android java back button closeapp
Java
4 votes308 views2 answers
Org.json.jsonobject to java object
Java
0 vote302 views1 answer
Android bootom app bar tab bar
Java
0 vote323 views1 answer
Stringbuilser
Java