""" You have a long flowerbed in which some of the plots are planted, and some are not. However, flowers cannot be planted in adjacent plots. Given an integer array flowerbed containing 0's and 1's, where 0 means empty and 1 means not empty, and an integer n, return true if n new flowers can be planted in the flowerbed without violating the no-adjacent-flowers rule and false otherwise. Example 1: Input: flowerbed = [1,0,0,0,1], n = 1 Output: true Example 2: Input: flowerbed = [1,0,0,0,1], n = 2 Output: false Constraints: 1 <= flowerbed.length <= 2 * 104 flowerbed[i] is 0 or 1. There are no two adjacent flowers in flowerbed. 0 <= n <= flowerbed.length """ from typing import List class Solution: def canPlaceFlowers(self, flowerbed: List[int], n: int) -> bool: flowerbed = [0] + flowerbed + [0] can_be_planted = 0 in_a_row_count = 0 for plot in flowerbed: if plot != 0: in_a_row_count = 0 else: in_a_row_count += 1 if in_a_row_count == 3: can_be_planted += 1 in_a_row_count = 1 if can_be_planted == n: return True return False obj = Solution() print(obj.canPlaceFlowers([1, 0, 0, 0, 1], 1))