##### Welcome to Subscribe On Youtube

Formatted question description: https://leetcode.ca/all/2086.html

# 2086. Minimum Number of Buckets Required to Collect Rainwater from Houses (Medium)

You are given a **0-index****ed** string `street`

. Each character in `street`

is either `'H'`

representing a house or `'.'`

representing an empty space.

You can place buckets on the **empty spaces** to collect rainwater that falls from the adjacent houses. The rainwater from a house at index `i`

is collected if a bucket is placed at index `i - 1`

**and/or** index `i + 1`

. A single bucket, if placed adjacent to two houses, can collect the rainwater from **both** houses.

Return *the minimum number of buckets needed so that for every house, there is at least one bucket collecting rainwater from it, or *

`-1`

*if it is impossible.*

**Example 1:**

Input:street = "H..H"Output:2Explanation:We can put buckets at index 1 and index 2. "H..H" -> "HBBH" ('B' denotes where a bucket is placed). The house at index 0 has a bucket to its right, and the house at index 3 has a bucket to its left. Thus, for every house, there is at least one bucket collecting rainwater from it.

**Example 2:**

Input:street = ".H.H."Output:1Explanation:We can put a bucket at index 2. ".H.H." -> ".HBH." ('B' denotes where a bucket is placed). The house at index 1 has a bucket to its right, and the house at index 3 has a bucket to its left. Thus, for every house, there is at least one bucket collecting rainwater from it.

**Example 3:**

Input:street = ".HHH."Output:-1Explanation:There is no empty space to place a bucket to collect the rainwater from the house at index 2. Thus, it is impossible to collect the rainwater from all the houses.

**Example 4:**

Input:street = "H"Output:-1Explanation:There is no empty space to place a bucket. Thus, it is impossible to collect the rainwater from the house.

**Example 5:**

Input:street = "."Output:0Explanation:There is no house to collect water from. Thus, 0 buckets are needed.

**Constraints:**

`1 <= street.length <= 10`

^{5}`street[i]`

is either`'H'`

or`'.'`

.

**Similar Questions**:

## Solution 1. Greedy

```
// OJ: https://leetcode.com/problems/minimum-number-of-buckets-required-to-collect-rainwater-from-houses/
// Time: O(N)
// Space: O(1)
class Solution {
public:
int minimumBuckets(string s) {
int N = s.size(), ans = 0;
for (int i = 0; i < N; ++i) {
if (s[i] != 'H') continue;
if (i - 1 >= 0 && s[i - 1] == 'B') continue;
if (i + 1 < N && s[i + 1] == '.') s[i + 1] = 'B', ++ans; // fill the right side as a priority
else if (i - 1 >= 0 && s[i - 1] == '.') ++ans;
else return -1;
}
return ans;
}
};
```