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.
  1. Prepare
  2. Algorithms
  3. Warmup
  4. Staircase
  5. Discussions

Staircase

Sort by

recency

|

5170 Discussions

|

  • awadallayossef
     + 0 comments

    time Complexity = O(n)

    def staircase(n: int):
    for x in range(1, n + 1):
        print(" " * (n - x) + "#" * x)

  • yashdeora98294
     + 0 comments

    Here is the website that published all the problems solutions - Programmingoneonone

  • tongyou1995
     + 0 comments
    def staircase(n):
    n_spaces = n - 1
    for i in range(1, n + 1):
        print(n_spaces * ' ' + i * '#')
        n_spaces -= 1
    
if __name__ == '__main__':
    n = int(input().strip())
    staircase(n)

  • devspace_fuzail
     + 0 comments

    Java 15

    public static void staircase(int n) { int repeat = 1; for(int i=n ; i > 0; i-- ) { System.out.println(" ".repeat(i-1)+"#".repeat(repeat++)); }

    }

  • somnath23kundu
     + 0 comments

    **//C# **

    public static void staircase(int n)
{
    string symbol="";

    for(int i=0;i<n;i++){
        string space = "";
        for(int j=0;j<n-(i+1);j++){
            space=space+" ";

        }
        symbol=symbol+"#";
        Console.WriteLine(space+symbol);
    }

}