Skip to content

Practice Ways to Split Array Into Good Subarrays

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#2750
LeetCode Problem

Ways to Split Array Into Good Subarrays

ArrayMathDynamic Programming

Problem Statement

You are given a binary array nums. A subarray of an array is good if it contains exactly one element with the value 1. Return an integer denoting the number of ways to split the array nums into good subarrays. As the number may be too large, return it modulo 10^9 + 7. A subarray is a contiguous non-empty sequence of elements within an array.

Source: Ways to Split Array Into Good Subarrays on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [0,1,0,0,1]
Output
3

# Example 2

Input
nums = [0,1,0]
Output
1

Constraints

1 <= nums.length <= 10^5
0 <= nums[i] <= 1

Related LeetCode Problems

Practice more problems similar to Ways to Split Array Into Good Subarrays.

1 Two Sum Easy2 Add Two Numbers Medium4 Median of Two Sorted Arrays Hard5 Longest Palindromic Substring Medium7 Reverse Integer Medium
← Previous Minimum Operations to Make the Integer ZeroNext → Robot Collisions

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free