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 votes192 views2 answers
Cls java
Java
0 vote205 views1 answer
Assign a random number in a set without replacement javva
Java
10 votes173 views5 answers
Java join list
Java
0 vote247 views1 answer
Splitting text with several condition in java
Java
1 vote196 views2 answers
Scanner.hasnext()
Java
0 vote187 views1 answer
Enter a word and print letters java
Java
0 vote138 views1 answer
Unmodifiable list java
Java
0 vote172 views1 answer
Android studio listview arrayadapter
Java
0 vote215 views1 answer
Which Is Better to Configure a Spring Boot Project — Properties or YAML?
Java Spring
4 votes158 views2 answers
Java uuid
Java