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 vote330 views1 answer
List of java
Java
-1 vote344 views1 answer
Polimorfismo java ejemplo
Java
1 vote362 views1 answer
Set remove element java
Java
0 vote394 views3 answers
Simple Write a simple Java program that prints a staircase or a figure as show
Java
1 vote349 views1 answer
Black belt in grepper
Java
1 vote358 views1 answer
Programmation android avoir acces à la liste des instants de partage
Java
0 vote333 views1 answer
Base64 in java
Java
4 votes339 views5 answers
Java main method
Java
0 vote375 views1 answer
Interface extending interface in java
Java
1 vote336 views1 answer
Exception in thread "main" java.lang.noclassdeffounderror: org/apache/commons/logging/logfactory
Java