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

3 votes105 views1 answer
Konnichiwa in japanese
Java
0 vote139 views1 answer
Spring boot eureka , zual hystrix, rest api docs
Java Spring
1 vote112 views1 answer
Spring gradle don't build boot jar
Java
10 votes98 views3 answers
Float java
Java
1 vote107 views1 answer
How to execute Shell Commands with Java and print the output directly while executing the command
Java
0 vote128 views2 answers
How to add background color in jframe
Java
0 vote117 views10 answers
Kjk;ok
Java
0 vote117 views1 answer
Spring boot MVC config
Java Spring
3 votes111 views1 answer
Padding a string with 0 in java
Java
0 vote111 views1 answer
Java collectors mapping
Java