You are given an integer array dist of length n, where dist[i] represents the distance of the $i^{ ext{th}}$ road segment. You are also given two integers speed and hoursBefore.

You traverse each road segment in sequential order at a constant speed of speed. After completing road segment $i$ (where $0 \leq i < n - 1$), you are required to rest until the next integer hour before starting the next road segment. However, you may choose to skip a rest period, allowing you to begin the next segment immediately without waiting. There is no rest period after the final road segment.

Return the minimum number of skips needed to reach your destination within hoursBefore hours, or $-1$ if it is impossible to arrive on time.

Constraints:

• n == dist.length

• $1 \leq$ n $\leq 1000$

• $1 \leq$ dist[i] $\leq 10^5$

• $1 \leq$ speed $\leq 10^6$

• $1 \leq$ hoursBefore $\leq 10^7$

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.