Package g1401_1500.s1477_find_two_non_overlapping_sub_arrays_each_with_target_sum

Class Solution

java.lang.Object
g1401_1500.s1477_find_two_non_overlapping_sub_arrays_each_with_target_sum.Solution
public class Solution extends Object
1477 - Find Two Non-overlapping Sub-arrays Each With Target Sum.<p>Medium</p> <p>You are given an array of integers <code>arr</code> and an integer <code>target</code>.</p> <p>You have to find <strong>two non-overlapping sub-arrays</strong> of <code>arr</code> each with a sum equal <code>target</code>. There can be multiple answers so you have to find an answer where the sum of the lengths of the two sub-arrays is <strong>minimum</strong>.</p> <p>Return <em>the minimum sum of the lengths</em> of the two required sub-arrays, or return <code>-1</code> if you cannot find such two sub-arrays.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> arr = [3,2,2,4,3], target = 3</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> Only two sub-arrays have sum = 3 ([3] and [3]). The sum of their lengths is 2.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> arr = [7,3,4,7], target = 7</p> <p><strong>Output:</strong> 2</p> <p><strong>Explanation:</strong> Although we have three non-overlapping sub-arrays of sum = 7 ([7], [3,4] and [7]), but we will choose the first and third sub-arrays as the sum of their lengths is 2.</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> arr = [4,3,2,6,2,3,4], target = 6</p> <p><strong>Output:</strong> -1</p> <p><strong>Explanation:</strong> We have only one sub-array of sum = 6.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= arr.length <= 10<sup>5</sup></code></li> <li><code>1 <= arr[i] <= 1000</code></li> <li><code>1 <= target <= 10<sup>8</sup></code></li> </ul>

  • Constructor Details

    • Solution

      public Solution()

  • Method Details

    • minSumOfLengths

      public int minSumOfLengths(int[] arr, int target)