Problem Brief

Arrange Coins 🐟

INTERNOA

Given an array of integers coins, where each element represents the number of coins. For each number of coins, output the maximum number of rows that can be stacked, with the stacking rule being: the first row contains one coin, the second row contains two coins, and so on.

1Example 1

Input

coins = [3, 4, 6]

Output

[2, 2, 3]

Explanation

No explanation for now..

Draft autosaves locally

public int[] arrangeCoins(int[] coins) {
    // write your code here
}

Input

coins

[3, 4, 6]

Output

[2, 2, 3]