CPMagical CP Library

Problem solution · Java

Find Two Non-overlapping Sub-arrays Each With Target Sum

Find Two Non-overlapping Sub-arrays Each With Target Sum: a Java solution using sliding window or two pointers. Learn the idea, check the complexity, and read the full code, with credit to walkccc LeetCode Solutions.

Technique
Sliding window or two pointers
Source
walkccc LeetCode Solutions
Length
26 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Sliding window or two pointers

For Find Two Non-overlapping Sub-arrays Each With Target Sum, the implementation maintains a moving interval and updates only the information that enters or leaves the window.

  1. Choose the invariant that makes a window valid or useful.
  2. Advance the right boundary and add the new element.
  3. Move the left boundary only as needed while maintaining the invariant and updating the answer.

Code notes

  • 26 lines of Java from the credited upstream file 1477-2.java.
  • The implementation visibly relies on sequence storage.
  • 2 loop blocks detected.

Complexity

Confirm that neither pointer moves backwards; if so, the scan is usually linear apart from the window’s data-structure operations.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from walkccc LeetCode Solutions by P.-Y. Chen (walkccc) and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeFind Two Non-overlapping Sub-arrays Each With Target Sum · JavaJava
Use this to learn the idea, then write your own version.
class Solution {  public int minSumOfLengths(int[] arr, int target) {    int ans = Integer.MAX_VALUE;    int sum = 0; // the window sum    // best[i] := the minimum length of subarrays in arr[0..i] that have    // sum = target    int[] best = new int[arr.length];    Arrays.fill(best, Integer.MAX_VALUE);     for (int l = 0, r = 0; r < arr.length; ++r) {      sum += arr[r]; // Expand the window.      while (sum > target)        sum -= arr[l++]; // Shrink the window.      if (sum == target) {        if (l > 0 && best[l - 1] != Integer.MAX_VALUE)          ans = Math.min(ans, best[l - 1] + r - l + 1);        best[r] = Math.min(best[r], r - l + 1);      }      if (r > 0)        best[r] = Math.min(best[r], best[r - 1]);    }     return ans == Integer.MAX_VALUE ? -1 : ans;  }}

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗