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 vote127 views1 answer
Hanoï recursive algorithm
Java
68 votes122 views6 answers
Remove duplicates from list
Java
0 vote122 views1 answer
Java komplettes array ausgeben
Java
0 vote116 views1 answer
Matlab leslie eigenvalue java
Java
135 votes169 views6 answers
Java random number generator
Java
0 vote124 views1 answer
Difference between Public, Private and Protected modifier in Java?
Java
0 vote119 views1 answer
How to find size of obj in java 8
Java
0 vote113 views1 answer
Java import swing
Java
0 vote120 views1 answer
Hide tablayout tab android
Java
1 vote117 views1 answer
Stringjoiner stream java
Java