@@ -0,0 +1,1294 @@
+/*%0A * Copyright 2017 haeun kim%0A *%0A * Licensed under the Apache License, Version 2.0 (the %22License%22);%0A * you may not use this file except in compliance with the License.%0A * You may obtain a copy of the License at%0A *%0A *      http://www.apache.org/licenses/LICENSE-2.0%0A *%0A * Unless required by applicable law or agreed to in writing, software%0A * distributed under the License is distributed on an %22AS IS%22 BASIS,%0A * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.%0A * See the License for the specific language governing permissions and%0A * limitations under the License.%0A */%0A%0Apackage algorithm.hackerrank.warmup;%0A%0Aimport java.util.Scanner;%0A%0A/**%0A * Created by haeun on 2017-09-13%0A * Site       : https://www.hackerrank.com/challenges/staircase%0A * Difficulty : Easy%0A */%0Apublic class Staircase %7B%0A    static void solve(int n)%7B%0A        for(int i = 1; i %3C= n; i++)%7B%0A            int a = i;%0A            while(a %3C n)%7B%0A                System.out.print(%22 %22);%0A                a++;%0A            %7D%0A            for(int j = 0; j %3C i; j++)%7B%0A                System.out.print(%22#%22);%0A            %7D%0A            System.out.println(%22%22);%0A        %7D%0A    %7D%0A%0A    public static void main(String%5B%5D args) %7B%0A        Scanner in = new Scanner(System.in);%0A        int n = in.nextInt();%0A        solve(n);%0A    %7D%0A%7D%0A

Solve Staircase from Hackerrank