← Microsoft questions

Count number of binary strings without consecutive 1’s

Filed under Microsoft

Given an integer n, find the number of binary strings of length n that do not contain two consecutive 1s.

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Microsoft questions

Collected from public candidate posts and coding forums. Updated Nov 2026.