Leetcode 605. Can Place Flowers

Given a binary array representing a flowerbed (0 = empty, 1 = planted) with no adjacent 1s, determine if you can add n new flowers without creating adjacent plants. This is typically solved greedily by scanning the array and planting whenever a 0 has empty neighbors (including edges) until you reach n or exhaust possibilities.

Asked at:

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Early December, 2025

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 605. Can Place Flowers

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact