Leetcode 2320. Count Number of Ways to Place Houses

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2320. Count Number of Ways to Place Houses

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact