Count the Hidden Sequences

Statement

You are given an integer array differences of length n, and two integers lower and upper. A hidden integer array hidden of length n + 1 is considered valid if it satisfies both conditions:

The value at each index stays within the inclusive range from lower to upper.

For every index i in the range from $0$ ...