Live Batches
Masterclasses
Menu
Free Courses
Account
Login / Sign Up
Problem Submissions Solution

Count Binary Strings

Difficulty: Medium

Acceptance: 60.00%

Points: 30.00

You are given an integer N. Your task is to count the total number of binary strings of length N such that no two consecutive 1s appear in the string.

Topics

Companies

Articles

Examples:

N/A

Constraints:
  • 1 = N = 30
Companies:
Samsung
Topics:
Recursion
Locked Content
Access Restricted: Please Login to access the code editor and test cases.