Maximize Solar Powered Bulbs

Problem Overview

• Given a binary string of bulbs, find the maximum total solar-powered bulbs after replacing some '0's with '1's so no new '1' is adjacent to another '1'.
• Input: string bulbs; Output: integer count of solar bulbs after optimal replacements; existing adjacent '1's may remain; the rule applies only to new placements.
• Real-world context: optimizing solar bulb installation in an office for sustainability.
• From Amazon interviews; a common coding interview problem and interview question.