मुख्य कंटेंट तक स्किप करें
Back to ChallengesCan Place FlowersEasy 20 min

Can Place Flowers

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 if n new flowers can be planted in the flowerbed without violating the no-adjacent-flowers rule.

Examples

Input: flowerbed = [1,0,0,0,1], n = 1
Output: true
A flower can be planted at index 2.
Input: flowerbed = [1,0,0,0,1], n = 2
Output: false
Only one flower can be planted.

Constraints

  • • 1 <= flowerbed.length <= 2 * 10^4
  • • flowerbed[i] is 0 or 1
  • • 0 <= n <= flowerbed.length

Complexity Analysis

Time
O(N)
iterating through the array once.
Space
O(1)
modifying array in place.

Test Cases

#1 One flower can fit
Input: flowerbed = [1,0,0,0,1], n = 1
Expected: true
#2 Not enough space for two
Input: flowerbed = [1,0,0,0,1], n = 2
Expected: false
Output
Click "Run Code" to see output here...