You are given a $0$ indexed integer array nums and a positive integer k.

In a single operation, you can select any contiguous subarray of length k from nums and decrease each element in that subarray by $1$.

Return true if it is possible to make all elements of nums equal to $0$ after applying any number of operations, or false otherwise.

Constraints:

• $1 \leq$ k $\leq$ nums.length $\leq 10^5$

• $0 \leq$ nums[i] $\leq 10^6$

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.