Binary subarrays with desired sum in JavaScript

Problem

We are required to write a JavaScript function that takes in a binary array, arr, as the first argument, and a number, target, as the second argument.

Our function is supposed to count the number of subarrays that exists in the array arr, the sum of whose elements is equal to count. We should finally return this count.

For example, if the input to the function is

Input

const arr = [1, 0, 1, 0, 1];
const target = 2;

Output

const output = 4;

Output Explanation

Because the desired subarrays are:

[1,0,1][1,0,1,0]
[0,1,0,1]
[1,0,1]

Example

 Live Demo

const arr = [1, 0, 1, 0, 1];
const target = 2;
const countSubarrays = (arr = [], target = 1) => {
   const map = {}
   let sum = 0
   let count = 0
   for (const num of arr) {
      map[sum] = (map[sum] || 0) + 1
      sum += num
      count += map[sum - target] || 0
   }
   return count
};
console.log(countSubarrays(arr, target));

Output

4

AmitDiwan

Updated on 23-Apr-2021 07:26:00

• Related Questions & Answers
• Binary Subarrays With Sum in C++
• Triplet with desired sum in JavaScript
• JavaScript Total subarrays with Sum K
• Subarrays product sum in JavaScript
• Finding n subarrays with equal sum in JavaScript
• Largest sum of subarrays in JavaScript
• Count subarrays with Prime sum in C++
• Finding desired sum of elements in an array in JavaScript
• Print all subarrays with 0 sum in C++
• Sum of All Possible Odd Length Subarrays in JavaScript
• Find all subarrays with sum equal to number? JavaScript (Sliding Window Algorithm)
• Find number of subarrays with even sum in C++
• Generating desired combinations in JavaScript
• Check if string ends with desired character in JavaScript
• Merging subarrays in JavaScript