Given an integer list flowerbed, each element is either $0$ (indicating an empty plot) or $1$ (indicating a planted plot), and an integer n. Determine if n new flowers can be planted without violating the rule that no two flowers can be planted in adjacent plots. Return TRUE if it’s possible to plant all n flowers. Otherwise, return FALSE.

Constraints:

• $1\leq$ flowerbed.length $\leq10^3$

• $0\leq$ n $\leq$ flowerbed.length

• flowerbed[i] is $0$ or $1$.

• There are no two adjacent flowers in the flowerbed.

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the problem correctly:

We have a game for you to play. Rearrange the logical building blocks to better understand how to solve this problem.

Implement your solution in the following coding playground.