# Staircase HackerRank Solution in C, C++, Java, Python

Staircase detail

This is a staircase of size :

   #
##
###
####


Its base and height are both equal to . It is drawn using # symbols and spaces. The last line is not preceded by any spaces.

Write a program that prints a staircase of size .

Function Description

Complete the staircase function in the editor below.

staircase has the following parameter(s):

• int n: an integer

Print

Print a staircase as described above.

Input Format

A single integer, , denoting the size of the staircase.

Output Format

Print a staircase of size  using # symbols and spaces.

Note: The last line must have  spaces in it.

Sample Input

6


Sample Output

     #
##
###
####
#####
######


Explanation

The staircase is right-aligned, composed of # symbols and spaces, and has a height and width of .

## Staircase HackerRank Solution in C++

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;

int main(){
int n;
cin>>n;
for(int i=0;i<n;i++)
{
for(int j=n-i; j>1;j--)
{
cout<<' ';
}
for(int j=i; j>=0;j--)
{
cout<<"#";
}
cout<<endl;

}

return 0;
}

## Staircase HackerRank Solution in C

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

int main() {
int n, i,j;
scanf("%d", &n);
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(j<(n-1-i)) printf(" ");
else printf("#");
}
printf("\n");
}

/* Enter your code here. Read input from STDIN. Print output to STDOUT */
return 0;
}

## Staircase HackerRank Solution in Python

n=int(input())
m=" "
t=1
while n>n-n:
print((n-1)*m+t*("#"))
n=n-1
t=t+1

## Staircase HackerRank Solution in Java

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

public static void main(String[] args) {
/* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
Scanner sc = new Scanner(System.in);

int i,j,k,n = sc.nextInt();

for(i=0;i<n;i++){

for(j=n-1;j>i;j--){
System.out.print(" ");
}
for(k=0;k<=i;k++)
System.out.print("#");
System.out.println();
}

}
}