We are given five non-negative real numbers a, b, c, d and e with a + b + c + d + e = 10, and X is the largest of the four sums a+b, b+c, c+d and d+e. We want to know the smallest value X can be pushed down to.
Since the five numbers together add up to 10, on average each one is worth $\dfrac{10}{5} = 2$. This average is the natural anchor for how small we can make every pairwise sum, because if the numbers are spread out close to this average value, none of the overlapping pairs a+b, b+c, c+d, d+e is forced to jump well above it.
Working with this average of 2 as the benchmark for each individual number, the tightest control we get over the largest pair sum X keeps it from climbing past the same neighbourhood as this average, so the least possible value of X falls in the band from 0 up to 2.
Let's summarize:
So the least possible value of X lies in the interval $[0, 2]$.