Bouquet Counting From Binary Pattern | Dataford Interview Questions

How would you compute the total number of bouquets from a binary pattern where you can form a bouquet from adjacent 0 and 1, or from three adjacent 1s?

Given a binary array, return the maximum number of disjoint bouquets. A bouquet uses either two adjacent, different bits, 01 or 10, or three adjacent 1 bits. Positions may be left unused.

Implement def max_bouquets(pattern):, where pattern is a non-empty list of integers containing only 0 and 1, and return an integer.

Constraints

1 <= len(pattern) <= 1000
Each element of pattern is either 0 or 1
Each position can be used by at most one bouquet
Positions may be left unused

Function Signature

def max_bouquets(pattern):

Your question is Bouquet Counting From Binary Pattern. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem