We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Loading...
  1. Practice
  2. Algorithms
  3. Warmup
  4. Staircase
  5. Discussions

Staircase

  • marinskiy + 6 comments

    Here is Python 3 solution from my HackerrankPractice repository:

    def staircase(a):
    for i in range(1, a + 1):
        print((a - i) * ' ' + i * "#")


n = int(input())
staircase(n)

    Feel free to ask if you have any questions :)

    • sqzhang1996 + 0 comments

      Thank you for your answer, but I think there is some wrong with this answers. Because the OUTPUT stairs we want is not very regular. That is if you watch carefully, the right side the stairs does not perfectly in line up. Do you have any other ideas?

    • mr_Bad_M + 0 comments

      I have tried the same, but with comma instead of plus in print call. actually result looks almost the same, but doesn't pass tests :)

    • vijita_malhotra1 + 0 comments

      I tried this way in Python3 

      def staircase(n):
    starthash = n-1
    for j in range(0,n):
        for i in range(0,n):
            if i < starthash:
                print (" ",end="")
            else:
                print ("#",end="")
        print("")
        starthash = starthash -1
    return 0
    • atri_sid + 0 comments

      I tried doing in one line using List Comprehension and List unpacking:

      def staircase(n): print([" "(n-i-1) + "#"*(i+1) for i in range(n)], sep='\n')

    • mferrac + 0 comments

      I think it needs to be: print(a-i+1)*' '

      Doesn't it? The stairs go irregular if it is not.

    • thom1376 + 1 comment

      Slightly better solution uses python 3 f-strings, they're more efficient:

      def staircase(n):
        for i in range(1, n + 1):
                print(f'{" " * n - i}{"#" * i}')


n = int(input())
staircase(n)
      • ms_1997 + 1 comment

        can u explain f-strings?

        • thom1376 + 0 comments

          In short, f-strings are similar to str.format(), however, they are less verbose and they are actually expressions that are evaluated at runtime. This means that you can also evaluate any python expression within the brackets.

          This page explains in much more detail how to use f-strings.

          This issue is why f-strings are faster than other string format methods.