...

/

Solution: Can Place Flowers

Solution: Can Place Flowers

Let’s solve the Can Place Flowers problem using the Greedy Techniques pattern.

Statement

Given an integer list flowerbed, each element is either 00 (indicating an empty plot) or 11 (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:

  • 11\leq flowerbed.length 103\leq10^3 ...