Given an integer n representing spaces on both sides of a street, count the total number of valid ways to construct buildings such that no two buildings are adjacent on the same side.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.