CPMagical CP Library

Problem solution · C++

Ways to Split Array Into Three Subarrays

Ways to Split Array Into Three Subarrays: a C++ 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
29 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 Ways to Split Array Into Three Subarrays, 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

  • 29 lines of C++ from the credited upstream file 1712-2.cpp.
  • The implementation visibly relies on sequence storage.
  • 3 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 codeWays to Split Array Into Three Subarrays · C++C++
Use this to learn the idea, then write your own version.
class Solution { public:  int waysToSplit(vector<int>& nums) {    constexpr int kMod = 1'000'000'007;    const int n = nums.size();    int ans = 0;    vector<int> prefix(n);     partial_sum(nums.begin(), nums.end(), prefix.begin());     for (int i = 0, j = 0, k = 0; i < n - 2; ++i) {      // Find the first index j s.t.      // left = prefix[i] <= mid = prefix[j] - prefix[i]      j = max(j, i + 1);      while (j < n - 1 && prefix[i] > prefix[j] - prefix[i])        ++j;      // Find the first index k s.t.      // mid = prefix[k] - prefix[i] > right = prefix[-1] - prefix[k]      k = max(k, j);      while (k < n - 1 && prefix[k] - prefix[i] <= prefix.back() - prefix[k])        ++k;      ans += k - j;      ans %= kMod;    }     return 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 ↗