You are given a string road and an integer budget.

The string road represents the condition of a road, where:

• '.' represents a smooth surface.

• 'x' represents a pothole.

Repairing a contiguous sequence of $k$ potholes costs $k + 1$ units of budget.

Return the maximum total number of potholes that can be repaired within the given budget.

Constraints:

• $1 \leq$ road.length $\leq 10^5$

• $1 \leq$ budget $\leq 10^5 + 1$

• road consists only of characters '.' and 'x'.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.