Software Engineer Interview Experience

Suppose you have a street with banks indexed beginning with 0 through n. Within each bank, there are $ amounts each bank holds. Yo uare trying to rob the banks on the street, but this street has a special alarm where if you rob two consecutive banks, it will go off and you'll be caught. The following are valid ways to rob the street (where Y means rob the bank, and N means skip it) YNYNYN _________ 0 1 2 3 4 5 YNNYNY _________ 0 1 2 3 4 5