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 vote166 views3 answers
Android imageview set image from drawable programmatically
Java
3 votes191 views1 answer
App.java is not on the classpath of project
Java
0 vote172 views1 answer
Java private method can't call public method
Java
1 vote230 views2 answers
Convert java code to kotlin online converter
Java
0 vote183 views1 answer
New date api in java 8
Java
0 vote204 views1 answer
Which Is Better to Configure a Spring Boot Project — Properties or YAML?
Java Spring
-4 votes166 views2 answers
Spring security logging
Java
0 vote181 views1 answer
De caracter a string en java
Java
16 votes139 views1 answer
What is java and who made it
Java
1 vote133 views1 answer
Java algorithm for drawing a line
Java