You are given an integer array batteryPercentages of length n, where batteryPercentages[i] represents the battery percentage of the device at index i.

Your task is to inspect each device sequentially from index $0$ to n $- 1$ by applying the following operations:

• If batteryPercentages[i] > 0:

  • Increment the total number of tested devices.

  • For every subsequent device at index j where i $< j <$ n, decrease its battery percentage by $1$, such that batteryPercentages[j] becomes $\max(0,$ batteryPercentages[j] $- 1)$.

• If batteryPercentages[i] $= 0$, move to the next device without making any changes.

Return the total count of devices that are tested after processing all devices.

Constraints:

• $1 \leq$ n $==$ batteryPercentages.length $\leq 100$

• $0 \leq$ batteryPercentages[i] $\leq 100$

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.