GEICO·Software Engineer·Technical Phone Screen
- Given a string representing a street where each character is either a house ('H') or an empty space ('.'), find the minimum number of food buckets you need to place in empty spots so that every house has at least one bucket directly next to it. Return -1 if it's not possible.
“The greedy angle is what makes this problem actually interesting.”