# HackerRank Subarray Division Solution Hello Programmers, In this post, you will know how to solve the HackerRank Subarray Division Solution. This problem is a part of the HackerRank Algorithms Series.

One more thing to add, don’t directly look for the solutions, first try to solve the problems of Hackerrank by yourself. If you find any difficulty after trying several times, then you can look for solutions.

## HackerRank Subarray Division Solution

Two children, Lily and Ron, want to share a chocolate bar. Each of the squares has an integer on it.

Lily decides to share a contiguous segment of the bar selected such that:

• The length of the segment matches Rons birth month, and,
• The sum of the integers on the squares is equal to his birth day.

Determine how many ways she can divide the chocolate.

Example

s = [2, 2, 1, 3, 2]
d = 4
m = 2
Lily wants to find segments summing to Ron’s birth day, d = 4 with a length equalling his birth month, m = 2. In this case, there are two segments meeting her criteria: [2, 2] and [1, 3].

Function Description

Complete the birthday function in the editor below.

birthday has the following parameter(s):

• int s[n]: the numbers on each of the squares of chocolate
• int d: Ron’s birth day
• int m: Ron’s birth month

Returns

• int: the number of ways the bar can be divided

Input Format

The first line contains an integer n, the number of squares in the chocolate bar.
The second line contains n space-separated integers s[i], the numbers on the chocolate squares where 0 <= i < n.
The third line contains two space-separated integers, d and m, Ron’s birth day and his birth month.

Constraints

• 1 <= n <= 100
• 1 <= s[i] <= 5, where (0 <= i < n)
• 1 <= d <= 31
• 1 <= m <= 12

Sample Input 0

```5
1 2 1 3 2
3 2
```

Sample Output 0

```2
```

Explanation 0

Lily wants to give Ron m = 2 squares summing to d = 3. The following two segments meet the criteria:

Sample Input 1

```6
1 1 1 1 1 1
3 2
```

Sample Output 1

```0
```

Explanation 1

Lily only wants to give Ron m = 2 consecutive squares of chocolate whose integers sum to d = 3. There are no possible pieces satisfying these constraints:

Thus, we print 0 as our answer.

Sample Input 2

```1
4
4 1
```

Sample Output 2

```1
```

Explanation 2

Lily only wants to give Ron m = 1 square of chocolate with an integer value of d = 4. Because the only square of chocolate in the bar satisfies this constraint, we print 1 as our answer.

## HackerRank Subarray Division Solution

### Subarray Division Solution in C

```#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>
int main(){
int n;
scanf("%d",&n);
int *squares = malloc(sizeof(int) * n);
for(int squares_i = 0; squares_i < n; squares_i++){
scanf("%d",&squares[squares_i]);
}
int d;
int m;
scanf("%d %d",&d,&m);
int count = 0;
for (int i = 0; i <= n-m; ++i){
int sum = 0;
for (int j = i; j < i+m; ++j){
sum += squares[j];
}
if (sum == d) ++count;
}
printf("%d", count);
return 0;
}```

### Subarray Division Solution in Cpp

```#include<bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define ll long long
using namespace std;
int n,d,m,a,s,ans;
int main(){
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
s[i]=s[i-1]+a[i];
}
cin>>d>>m;
for(int i=m;i<=n;i++)
if(s[i]-s[i-m]==d)
ans++;
cout<<ans<<endl;
return 0;
}```

### Subarray Division Solution in Java

```import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;
public class Solution {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int[] squares = new int[n];
for(int squares_i=0; squares_i < n; squares_i++){
squares[squares_i] = in.nextInt();
}
int d = in.nextInt();
int m = in.nextInt();
int total = 0;
for(int i = 0; i < n - m + 1; i++) {
int sum = 0;
for (int j = i; j < i + m; j++){
sum = sum + squares[j];
}
if (sum == d) {
total = total + 1;
}
}
System.out.println(total);
}
}```

### Subarray Division Solution in Python

```#!/bin/python
import sys
n = int(raw_input().strip())
squares = map(int, raw_input().strip().split(' '))
d,m = raw_input().strip().split(' ')
d,m = [int(d),int(m)]
num_ways = 0
for i in range(len(squares)-m+1):
if sum(squares[i:i+m]) == d:
num_ways += 1

print num_ways```

### Subarray Division Solution using JavaScript

```process.stdin.resume();
process.stdin.setEncoding('ascii');
var input_stdin = "";
var input_stdin_array = "";
var input_currentline = 0;
process.stdin.on('data', function (data) {
input_stdin += data;
});
process.stdin.on('end', function () {
input_stdin_array = input_stdin.split("\n");
main();
});
return input_stdin_array[input_currentline++];
}
/////////////// ignore above this line ////////////////////
function main() {
squares = squares.map(Number);
var d = parseInt(d_temp);
var m = parseInt(d_temp);
var count = 0;
for(var i = 0; i < n; i++){
var sum = 0;
for(var j = i; j < i + m; j++){
sum += squares[j];
}
if(sum == d){
count++;
}
}
console.log(count);
}```

### Subarray Division Solution in Scala

```object Solution {
def main(args: Array[String]) {
val sc = new java.util.Scanner (System.in);
val n = sc.nextInt();
val squares = new Array[Int](n);
for(squares_i <- 0 to n-1) {
squares(squares_i) = sc.nextInt();
}
val d = sc.nextInt();
val m = sc.nextInt();
val r = numberOfWays(m, d, squares.toList)
println(r)
}
def numberOfWays(m:Int, d: Int, squares:List[Int]) : Int = {
val total = squares.sliding(m).foldLeft(0){
case(r, ll) => if((ll.sum) == d) {r+1} else {r}
}
total
}
}```

### Subarray Division Solution in Pascal

```(* Enter your code here. Read input from STDIN. Print output to STDOUT *)
type
vector = array [1..100] of byte;
var
i, n, m, d, k: byte;
ar : vector;
function test(firstN:byte): byte;
var j : byte; sum, res:byte;
begin
sum := 0;
for j:=0 to m-1 do
begin

sum:= ar[j+firstN]+sum;
end;
if sum = d then
res :=1
else
res := 0;
if firstN+m > n then
test := res
else
test := res+test(firstN +1);
end;
begin
// writeln(n);
for i:= 1 to n-1 do
//   writeln(m);
//  writeln(d);
writeln(test(1));
end.```

Disclaimer: This problem (Subarray Division) is generated by HackerRank but the Solution is Provided by BrokenProgrammers. This tutorial is only for Educational and Learning purposes.