Available question text
Count placements of houses on two independent rows of n plots so that no two houses are adjacent on the same side; this reduces to counting binary strings of length n with no consecutive ones (a Fibonacci sequence) and returning the square of that count modulo 1e9+7.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2320. Count Number of Ways to Place Houses
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source