You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins. Given n, find the total number of full staircase rows that can be formed. n is a non-negative integer and fits within the range of…

You have a total of n coins that you want to form in a staircase shape, where every k-th row must have exactly k coins. Given n, find the total number of fullstaircase rows that can be formed. n is a non-negative integer and fits within the range of…

public class Solution { public int ArrangeCoins(int n) { //convert int to long to prevent integer overflow long nLong = (long)n; ; long ed = nLong; ; while (st <= ed) { mid = st + (ed - st) / ; ) <= * nLong) { st = mid + ; } else { ed = mid - ; } }…