We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Subarray Division
  5. Discussions

Subarray Division

  • alban_tyrex
     + 1 comment

    Here is my O(N) c++ solution, you can watch the explanation here : https://youtu.be/L2fkDuGrxiI

    int birthday(vector<int> s, int d, int m) {
    if(s.size() < m) return 0;
    int su = accumulate(s.begin(), s.begin() + m, 0), result = 0;
    if(su == d) result++;
    for(int i = m; i < s.size(); i++){
        su += s[i];
        su -= s[i-m];
        if(su == d) result++;
    }
    return result;
 }