https://github.com/alvp01/mob-programming-subarray

https://github.com/alvp01/mob-programming-subarray

Last synced: about 1 hour ago
JSON representation

• Host: GitHub
• URL: https://github.com/alvp01/mob-programming-subarray
• Owner: alvp01
• Created: 2022-01-11T14:28:43.000Z (about 3 years ago)
• Default Branch: main
• Last Pushed: 2022-01-12T14:29:15.000Z (about 3 years ago)
• Last Synced: 2025-01-13T14:52:02.909Z (4 days ago)
• Size: 1000 Bytes
• Stars: 5
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# mob-programming-subarray

[Hackerrank](https://www.hackerrank.com/challenges/the-birthday-bar/problem?isFullScreen=true) challenge

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.

Constraints

- 1 <= n <= 100

- 1 <= s[i] <= 5, where 0 <= i <= n

- 1 <= d <= 31

- 1 <= m <= 12