Staircase - HackerRank || HackerRank Staircase Solution
Problem Name: Staircase
Judge: HackerRank
Problem link: Staircase
HackerRank Staircase Solution in C
#include <stdio.h>
int main()
{
int n, i, j;
scanf("%d", &n);
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n - i; j++)
{
printf(" ");
}
for (j = 1; j <= i; j++)
{
printf("#");
}
printf("\n");
}
return 0;
}
HackerRank Staircase Solution in C++/Cpp
#include <bits/stdc++.h>
using namespace std;
int main()
{
int n, i, j;
scanf("%d", &n);
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n - i; j++)
{
cout << " ";
}
for (j = 1; j <= i; j++)
{
cout << "#";
}
cout << endl;
}
return 0;
}
HackerRank Staircase Solution in Java
import java.util.Scanner;
public class Staircase {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int n = input.nextInt();
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n - i; j++) {
System.out.print(" ");
}
for (int j = 1; j <= i; j++) {
System.out.print("#");
}
System.out.println();
}
}
}
