Given three integers, N, K and M. The task is to find out the number of binary strings of length N which always starts with 1, in which there can be at most M consecutive 1’s or 0’s and they alternate exactly K times.
Input: N = 5, K = 3, M = 2
The 3 configurations are:
Notice that the groups of 1’s and 0’s alternate exactly K times
Input: N = 7, K = 4, M = 3
- Sub-problem: DP[i][j] represents the number of binary strings upto length i having j alternating groups till now. So, to calculate dp[N][K] if we know the value of dp[n-j][k-1], then we can easily get the result by summing up the sub-problem value over j = 1 to m (DP[N][K] represents the final answer).
- Optimal substructure:
- By following the top-down DP approach:
As we can have a group which can be atmost of the length M, so we iterate on every possible length and recur with new N and decreasing K by 1, as a new group is formed. Solution to sub-problem is cached and summed up to give final result dp[N][K].
- Base Case:
- When N is 0 and K is 0, then return 1
- When N is 0 but K is not 0, then return 0
- When N is not 0 but K is 0, then return 0
- When both are negative, return 0
Below is the implementation of above approach:
Time complexity: O(N*K*M)
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- Count of binary strings of length N with even set bit count and at most K consecutive 1s
- Find the number of binary strings of length N with at least 3 consecutive 1s
- Sum of all numbers formed having 4 atmost X times, 5 atmost Y times and 6 atmost Z times
- Count number of binary strings without consecutive 1's
- Count number of binary strings without consecutive 1’s : Set 2
- Count binary strings with k times appearing adjacent two set bits
- Count number of binary strings of length N having only 0's and 1's
- Count of binary strings of given length consisting of at least one 1
- Count number of binary strings such that there is no substring of length greater than or equal to 3 with all 1's
- Count of subsequences of length atmost K containing distinct prime elements
- Generate all binary strings without consecutive 1's
- Count strings with consecutive 1's
- Length of longest consecutive ones by at most one swap in a Binary String
- Count of sub-strings with equal consecutive 0's and 1's
- Number of binary strings such that there is no substring of length ≥ 3
- Generate all binary strings of length n with sub-string "01" appearing exactly twice
- Generate Binary Strings of length N using Branch and Bound
- Number of Binary Strings of length N with K adjacent Set Bits
- Count the number of Special Strings of a given length N
- Count ways to increase LCS length of two strings by one
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.