# Having a hard time wrapping my head around this Codility question with finding consecutive segments?

The problem is:

There is a road consisting of N segments, numbered from 0 to N-1, represented by a string S.

Segment S[K] of the road may contain a pothole, denoted by a single uppercase “x” character, or may be a good segment without any potholes, denoted by a single dot,”.”.

For example, string”.X. .X” means that there are two potholes in total in the road: one is located in segment S[1] and one in segment S[4].

All other segments are good. The road fixing machine can patch over three consecutive segments at once with asphalt and repair all the potholes located within each of these segments. Good or already repaired segments remain good after patching them. Your task is to compute the minimum number of patches required to repair all the potholes in the road.

Write a function: def solution(s) that, given a string S of length N, returns the minimum number of patches required to repair all the potholes.

Examples: 1. Given S=”.X..x”, your function should return 2. The road fixing machine could patch, for example, segments 0-2 and 2-4. 2.

Given S = “x.xxxxx.x”, your function should return 3. The road fixing machine could patch, for example, segments 0-2, 3-5 and 6-8. 3.

Given S = “xx.xxx”, your function should return 2. The road fixing machine could patch, for example, segments 0-2 and 3-5. 4. Given S = “xXxx”, your function should return 2.

My issue is that I don’t really know where to begin with this. I am genuinely stumped. Can someone help?

It is preferred that you write the code and then ask for any clarifications.
However, you can solve it by walking on road and patching the first pothole. Then keep walking and fix the next one if you find it is not fixed by earlier patchwork.

See below:

```def get_minimum_patches(road):
if block.lower() != 'x':
continue
continue

if __name__ == '__main__':
```2