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

-2 votes180 views6 answers
Spring enable cors
Java Spring
8 votes225 views10 answers
Hi
Java
0 vote203 views1 answer
How to convert timestamp to time in java
Java
7 votes177 views2 answers
Read double java
Java
2 votes144 views1 answer
Java random unique number
Java
9 votes158 views1 answer
How to change a character in a string in java with ascii
Java
0 vote141 views1 answer
Jpa default value enum
Java
0 vote236 views2 answers
Auto in java
Java
8 votes152 views2 answers
Java first letter to upper case
Java
2 votes139 views1 answer
Com.android.builder.dexing.DexArchiveMergerException:
Java