old_contents: [href.] https://leetcode.com/problems/arranging-coins/
  
  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 a 32-bit signed integer.
  
new_contents: class Solution(object):
      def arrangeCoins(self, n):
          """
          :type n: int
          :rtype: int
          """
          x   = n
          y   = 1
          cnt = 0
      
          while y <= x:
              x   -= y
              y   += 1
              cnt += 1
      
          return cnt
  
subject: Update solution.py