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 vote156 views1 answer
Java commands in different packages not working
Java
0 vote144 views4 answers
Java mahout get clusters centers
Java
7 votes162 views4 answers
Remove duplicate string collection in java
Java
0 vote148 views1 answer
Return type of executebatch in java
Java
0 vote133 views1 answer
Java stop script
Java
6 votes138 views2 answers
RecyclerView OnClickListener
Java
2 votes139 views1 answer
Permutation array java
Java
0 vote160 views1 answer
Validation failed for query for method public abstract java.util.List
Java
20 votes147 views3 answers
Replace string java online
Java
0 vote154 views1 answer
Java size of linked list
Java