You are given an integer n representing the number of coins.

Arrange the coins into a staircase shape where the $i$th row contains exactly $i$ coins. The first row has $1$ coin, the second row has $2$ coins, and so on.

Return the number of complete rows that can be formed using all the coins.

Note: A row is complete only if it contains exactly the required number of coins.

Constraints:

• $1 \leq$ n $\leq 2^{31} - 1$

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.