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.