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

0 vote161 views1 answer
Comment générer un nombre aléatoire en java
Java
0 vote168 views1 answer
Index 1 out of bound for length 1 java
Java
12 votes172 views2 answers
Java date time
Java
-3 votes202 views2 answers
Multiplication table for number Java
Java
1 vote142 views1 answer
Gradle sqlite jdbc
Java
5 votes198 views2 answers
String remove duplicate in java
Java
0 vote188 views1 answer
Procedure java
Java
0 vote195 views2 answers
App dashboard cardview click effect and animation android studio
Java
1 vote181 views1 answer
Sreekanth kasani
Java
1 vote187 views1 answer
Java contains password input
Java