Listen "Count Binary Strings"
Episode Synopsis
1. You are given a number n.
2. You are required to print the number of binary strings of length n with no consecutive 0's.
Input Format
A number n
Output Format
A number representing the number of binary strings of length n with no consecutive 0's.
Constraints
0 < n <= 45
Sample Input
6
Sample Output
21
2. You are required to print the number of binary strings of length n with no consecutive 0's.
Input Format
A number n
Output Format
A number representing the number of binary strings of length n with no consecutive 0's.
Constraints
0 < n <= 45
Sample Input
6
Sample Output
21
More episodes of the podcast algodextrous
Maximum Sum Non Adjacent Elements
07/08/2021
Count A+B+C+ Subsequences
07/08/2021
Count Encodings
23/07/2021
Arrange Buildings
23/07/2021
Fractional Knapsack
31/05/2021
Unbounded Knapsack
31/05/2021
Zero One Knapsack
30/05/2021
Coin Change Permutations
30/05/2021
Coin Change Combination
28/05/2021
