Discussion on Subarray Division Challenge

Sort by

recency

|

3091 Discussions

|

2 weeks ago+ 1 comment

TypeScript ugly one-liner:

function birthday(s: number[], d: number, m: number): number {
  return s.flatMap((_, i) => [s.slice(i, m + i)]).filter((arr) => arr.reduce((a, b) => a + b, 0) === d).length;
}

1 day ago+ 0 comments

Subarray Division is a common problem in programming and mathematics where the goal is to divide an array into smaller parts (subarrays) that meet specific conditions, such as having a certain length or summing to a particular value. This concept is often used in coding challenges, for example in problems where you need to count how many contiguous subarrays of a given size have a sum equal to a target number. Solving such tasks requires efficient traversal techniques, like sliding window or prefix sums, to avoid unnecessary calculations Car parking multipleplayer mod version and improve performance.

3 weeks ago+ 0 comments

int birthday(vector<int> s, int d, int m) {
    std::vector<int>::iterator left = s.begin();
    std::vector<int>::iterator right = left + m; // points behind sliding window
    
    int sum = std::accumulate(left, right, 0);
    int numWays = sum == d ? 1 : 0;
    
    while (right != s.end()) {
        sum = sum - *left + *right; // update sum
        left++; right++; // and move the sliding window
        
        if (sum == d)
            numWays++;
    }
    
    return numWays;
}

1 month ago+ 1 comment

O(n): function birthday(s, d, m) { // Write your code here let count = 0; for (let i=0; i 0 ? s[i-1]: 0); if (i == m -1 && s[i] == d) { count += 1 } if (i > m - 1 && s[i] - s[i-m] == d) { count += 1 } } return count; }

4 weeks ago+ 0 comments

Subarray division is a common problem in computer science where an array is divided into smaller, continuous segments to meet certain conditions, such as achieving a target sum or fitting a specific length. This concept is often applied bitlife unlocked in coding challenges and real-world scenarios like data analysis, where identifying patterns within a dataset is essential. For example, a subarray division problem may ask to count the number for bitlife unlocked of contiguous subarrays of a given length that add up to a specified value.

1 month ago+ 0 comments

Here is my solution, using JavaScript

function birthday(s, d, m) {
    // Write your code here
    let count = 0;
    while (s.length >= m){
      let sum = 0;
      // sum terms
      for(let i=0; i<m; i++){
        sum += s[i];
    }
    if(sum===d) count++;    
    s.shift();
    } 
    return count;
}

1 month ago+ 0 comments

//javascript function birthday(s, d, m) { // Write your code here

let contador = 0;

for (let i = 0; i <= s.length - m; i++) {

const bloque = s.slice(i, i + m);

const suma = bloque.reduce((acumulador, valorActual) => acumulador + valorActual, 0);

if (suma === d) {
  contador++;
}

}

return contador;

}

Sort by

|

3091 Discussions

|

Cookie support is required to access HackerRank

Please signup or login in order to view this challenge