Available question text
Place the minimum number of buckets on '.' positions in a 1D string so that every 'H' has a bucket at index i-1 or i+1, or return -1 if some hamster has no adjacent empty spot. This is a linear greedy/covering problem on a path (detecting impossible configurations like an H with both neighbors being H or out of bounds).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2086. Minimum Number of Food Buckets to Feed the Hamsters
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source