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. Subarray Division 1
  2. Discussions

Subarray Division 1

Sort by

recency

|

285 Discussions

|

  • ayushsaxena1512
     + 0 comments
    int birthday(vector < int > s, int d, int m) {
    int ways = 0;
    for (int i = 0; i < s.size(); i++) {
        int sum = 0;
        for (int j = i; j < m + i; j++) {
            sum += s[j];
        }
        if (sum == d) {
            ways++;
        }
    }
    return ways;
}

  • calancea_bianca1
     + 0 comments
    def birthday(s, d, m):
    # Write your code here
    ways=0
    end=m
    begin=0
    
    while end<=len(s):
        summ=0
        for i in range(begin,end):
            summ+=s[i]
        if summ==d:
            ways+=1
        end+=1
        begin+=1
    return ways

  • martin_montelon1
     + 0 comments

    int contador = 0; for(int x = 0; x < s.Count - m +1 ; x++) { int valor = 0; for(int y = x; y < x + m; y++ ) { valor += s[y]; }
    if(valor == d) { contador ++; } } return contador;

  • juandadky2020
     + 0 comments

    Kotlin Solution

    fun birthday(s: Array<Int>, d: Int, m: Int): Int {
    return (0 until s.size-m+1).map { i -> s.slice(i until m+i) }.filter { it.sum() == d }.size
}

  • mcoroz96
     + 0 comments

    c++20

    int birthday(vector<int> s, int d, int m) {
    int nCombos = 0;
    for(int i = 0; i < s.size() ; i++){
        if(std::accumulate(s.begin() + i, s.begin() + i + m, 0) == d){
            nCombos +=1;
        }
    }
    return nCombos;
}