← Atlassian questions
CodingReported in a candidate post, Aug 2020

String formations with constraints on consecutive 0s and 1s

Filed under Atlassian

The question

Find the number of ways to form a string of size N given unlimited 0s and 1s, without having D consecutive 0s and T consecutive 1s.

No write-up yet. Related questions below have one.

Related Atlassian questions

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