Fundamentals
/
Backtracking - Counting Problems
⏸
00:00
↻
← Prev
Next →
▶
Question
Given an integer n, return the count of binary strings of length n that contain no two consecutive 1s. Solve with backtracking.
▶
Understand
▶
Approach
▶
My Code
▶
Reference Solution
Compare
20