Can Place Flowers Problem

Can Place Flowers Problem — ExecCode Easy DSA Practice

Solve the Can Place Flowers problem on ExecCode. Free online easy DSA practice in Arrays - Logic Building. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You have a long flowerbed in which some of the plots are planted, and some are not. Your task is to 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. However, flowers cannot be planted in adjacent plots.

Examples

Input flowerbed = [1, 0, 0, 0, 1], n = 1; Output true. Input flowerbed = [1, 0, 0, 0, 1], n = 2; Output false

Constraints

1 <= flowerbed.length <= 2 * 10^4 flowerbed[i] is 0 or 1. There are no two adjacent flowers in flowerbed. 0 <= n <= flowerbed.length

Practice Can Place Flowers free on ExecCode. Browse DSA problems, topic map, and placement guides.