Given an integer array coins of length n, return the maximum number of consecutive integer values you can form starting from $0$.

You can select any subset of elements from coins and sum their values to form an integer value.

Constraints:

• coins.length $= n$

• $1 \le n \le 4 imes 10^4$

• $1 \le$ coins[i] $\le 4 imes 10^4$

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.