You are given an integer array strength of length n, representing the strengths of n different locks.

Initially, your accumulated energy is $0$, and you have an energy generation factor X set to $1$.

Every minute, your accumulated energy increases by X. You can choose to break an unbroken lock with a strength of strength[i] at any minute where your current accumulated energy is at least strength[i].

Breaking a lock immediately resets your accumulated energy to $0$ and increases the factor X by $1$.

Return the minimum number of minutes needed to break all $n$ locks.

Constraints:

• n == strength.length

• $1 \le$ n $\le 80$

• $1 \le$ strength[i] $\le 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.