Can Place Flowers

LeetCode 605 • Easy • Arrays & Hashing

flowerbed = [1,0,0,0,1], n = 1 → true. Place flowers so no two are adjacent.

TimeO(n)

SpaceO(1)

i: —planted: 0need left: 1

Current i

Existing

Newly planted

i—

bed[ ]

Speed:

Ready

Press Play or Step to walk the algorithm.

Whiteboard

Size:3

Type It

Practice until you don't need to look.

═══ CAN PLACE FLOWERS ═══

PATTERN ▸ Greedy scan O(n) · O(1)

① For each empty plot

left & right neighbors empty (or edge)

② Plant & decrement n

early True when n hits 0

your implementation

Verify: