Solving Arranging Coins in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

Example 1:

n = 5

The coins can form the following rows:

Because the 3rd row is incomplete, we return 2.

Example 2:

n = 8

The coins can form the following rows:

Because the 4th row is incomplete, we return 3.

See the full details of the problem Arranging Coins at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go