SubArray Division HackerRank 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 Ron's 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

Lily wants to find segments summing to Ron's birth day,  with a length equalling his birth month, . In this case, there are two segments meeting her criteria:  and .

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 , the number of squares in the chocolate bar.
The second line contains  space-separated integers , the numbers on the chocolate squares where .
The third line contains two space-separated integers,  and , Ron's birth day and his birth month.

Solution:

import java.io.*;

import java.math.*;

import java.security.*;

import java.text.*;

import java.util.*;

import java.util.concurrent.*;

import java.util.function.*;

import java.util.regex.*;

import java.util.stream.*;

import static java.util.stream.Collectors.joining;

import static java.util.stream.Collectors.toList;

class Result {

    /*

     * Complete the 'birthday' function below.

     *

     * The function is expected to return an INTEGER.

     * The function accepts following parameters:

     *  1. INTEGER_ARRAY s

     *  2. INTEGER d

     *  3. INTEGER m

     */

    public static int birthday(List<Integer> s, int d, int m) {

    // Write your code here

int n=s.size();

int count=0;

for(int i=0;i<=n-m;i++) // i iterraion upto array length -subarray length

{

    int sum=0;

   

    for(int j=i;j<i+m;j++) // j iteration upto current i and next m element -1

    {

        sum=sum+s.get(j);

    }

    if(sum==d)

    {

        count++;

    }

}

return count;

    }

}

public class Solution {

    public static void main(String[] args) throws IOException {

        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));

        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));

        int n = Integer.parseInt(bufferedReader.readLine().trim());

        List<Integer> s = Stream.of(bufferedReader.readLine().replaceAll("\\s+$", "").split(" "))

            .map(Integer::parseInt)

            .collect(toList());

        String[] firstMultipleInput = bufferedReader.readLine().replaceAll("\\s+$", "").split(" ");

        int d = Integer.parseInt(firstMultipleInput[0]);

        int m = Integer.parseInt(firstMultipleInput[1]);

        int result = Result.birthday(s, d, m);

        bufferedWriter.write(String.valueOf(result));

        bufferedWriter.newLine();

        bufferedReader.close();

        bufferedWriter.close();

    }

}