Stair Case | Hacker Rank Solution in Java 7

Problem:

Consider a staircase of size :

   #
  ##
 ###
####

Observe that its base and height are both equal to , and the image is drawn using # symbols and spaces. The last line is not preceded by any spaces.

Write a program that prints a staircase of size .



Solution:

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

public class Solution {

    // Complete the staircase function below.
    static void staircase(int n) {
for(int i=0;i<n;i++)
{
    for(int k=n-1;k>i;k--)
    {
        System.out.print(" ");
    }
    for(int j=0;j<=i;j++)
    {
        System.out.print("#");
    }
    System.out.println();
}

    }

    private static final Scanner scanner = new Scanner(System.in);

    public static void main(String[] args) {
        int n = scanner.nextInt();
        scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");

        staircase(n);

        scanner.close();
    }
}

Comments

Post a Comment

Popular posts from this blog

Write a Function | Hacker Rank Solution in Python

Problem: An extra day is added to the calendar almost every four years as February 29, and the day is called a  leap day . It corrects the calendar for the fact that our planet takes approximately 365.25 days to orbit the sun. A leap year contains a leap day. In the Gregorian calendar, three conditions are used to identify leap years: The year can be evenly divided by 4, is a leap year, unless: The year can be evenly divided by 100, it is NOT a leap year, unless: The year is also evenly divisible by 400. Then it is a leap year. This means that in the Gregorian calendar, the years 2000 and 2400 are leap years, while 1800, 1900, 2100, 2200, 2300 and 2500 are NOT leap years.  Source Solution: def is_leap(year):     leap = False     if year%4==0 and (year%400==0 or year%100!=0):             leap=True     else:         leap=False     return leap year =  int ( raw_input ()) print ...
Read more

Diagonal Difference | Hacker Rank Solution in C

Problem: Given a square matrix, calculate the absolute difference between the sums of its diagonals. For example, the square matrix   is shown below: 1 2 3 4 5 6 9 8 9 The left-to-right diagonal =  . The right to left diagonal =  . Their absolute difference is  . Solution: #include <stdio.h> #include <string.h> #include <math.h> #include <stdlib.h> int main() {     int a[100][100],n,c=0,d=0,i,j,sum=0;     scanf("%d",&n);     for(i=0;i<n;i++)         for(j=0;j<n;j++)             scanf("%d",&a[i][j]);     for(i=0;i<n;i++)          c=c+a[i][i];             for(i=0;i<n;i++)          d=d+a[i][n-1-i];     sum=abs(c-d);     printf("%d",sum);                   /* Enter your code here....
Read more

Print Function | Hacker Rank Solution in Python

Problem: The included code stub will read an integer,  , from STDIN. Without using any string methods, try to print the following: Note that " " represents the consecutive values in between. Example Print the string  . Solution: from  __future__  import  print_function if  __name__ ==  '__main__' :     n =  int ( raw_input ())     i= 1      print (* range ( 1 ,n+ 1 ),sep= "" )         
Read more