Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.