Leetcode Problem 2533. Number of Good Binary Strings

2533. Number of Good Binary Strings

Leetcode Solutions

Initialize a dynamic programming array dp of size maxLength + 1 with all elements set to 0.
Set dp[0] to 1.
Iterate over all lengths i from 1 to maxLength. a. If i is greater than or equal to oneGroup, add dp[i - oneGroup] to dp[i]. b. If i is greater than or equal to zeroGroup, add dp[i - zeroGroup] to dp[i]. c. Take the modulo of dp[i] with 10^9 + 7 to prevent integer overflow.
Initialize a variable result to 0.
Iterate over all lengths i from minLength to maxLength. a. Add dp[i] to result. b. Take the modulo of result with 10^9 + 7.
Return result as the final answer.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen