I can't comment in formatted way. Can you tell me how to do that?

I was looking for exactly that type of string method. I figured c# just had to have something like that. Thanks fer sharin'.

It needs less coding, but it is not a fast approach. This String constrcutor overload is too slow.

Check here: http://www.codeexplain.com/code/0cecd228-c32e-4a5a-b136-2461c4743a99 "I can get Substring to be 5-6 times faster but using a constructor like String(Char, Int32) turns out to be atleast 3 times slower"

That is ugly. Meet Python

n = int(raw_input())
for i in range(1,n+1):
    print " "*(n-i) + "#"*i

Wow. Smart way to code. Thanks for sharing this!!!

you actually can remove the second parameter in the padleft method

Even easier in python

n = int(raw_input().strip())
for i in reversed(xrange(n)):
    print (' ' * (i)) + ('#' * (n - i))

Thank you so much, but would you mind telling me why use PadLeft(N,' ') instead of PadLeft(N-1,' ')? The 1st N=6 right? I tried to use N-1, but it only prints out 4 spaces on the first line.

I didn't know about the PadLeft option. 'Preciate your sharing this.

Also, you can start the iterator at i=1 to avoid the "i+1" in the string constructor, then run it until i<=N. It's all the same, of course, but a little more intuitive for folks like me.

Easy Ruby:

(1..n).step(1) { |i| str = " "*(n-i)+("#"*i); puts str }

I used a slightly different approach:

int size = Convert.ToInt32(Console.ReadLine());
        
        for(int i=1;i<=size;i++){            
            Console.WriteLine(new string(' ', size - i) + new string('#', i));            
        }

Interesting. I used Enumerable.Repeat and concatenating a string. I prefer your padleft approach though

int n = Convert.ToInt32(Console.ReadLine());
for(int i = 0; i < n; i++)        
{            
    string w = string.Join("", Enumerable.Repeat(" ", (n-1) - i));
    w += string.Join("", Enumerable.Repeat("#", i + 1));      
    Console.WriteLine(w);
}

I will simplify it like this:-

for(int i=1;i <= N ; i++) Console.WriteLine(new String('#',i).PadLeft(N));

Did a similar thing

for(int i = 1; i < n+1; i++) {
    Console.WriteLine(new string (' ', (n-i)) + new string ('#', (i)));
}

I did not know that String overload :/ My solution:

using System;
class Solution
{
    static void Main(String[] args)
    {
        int N = int.Parse(Console.ReadLine());
        for (int i = 0; i < N; i++)
            Console.WriteLine(Clone('#', i).PadLeft(N, ' '));
    }
    
    private static string Clone(char character, int count)
    {
    	return "".PadLeft(count, character);
    }
}

Did it like this in C. Could this get shorter?

int main(){
    int n;
    scanf("%d",&n);
    int a = n;
    char space = ' ';
    char hash = '#';
    
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < a - 1; j++)
        {
            printf("%c", space);
        }
        
        a--;
        
        for(int k = 0; k < i + 1; k++)
        {
            printf("%c", hash);
        }
        printf("\n");
    }
    return 0;
}

Its too easy with Python! :) here..

n=int(input())
for i in range(1,n+1):  print(' '*(n-i)+'#'*i)

more easy in python one line

(lambda num: [print(('#'*x).rjust(num)) for x in range(num+1)])(int(input().strip()))

include

using namespace std;

int main() { int n; cin >> n; for(int i=0;in-i-2) cout<<"#"; else cout<<" "; } cout<

JavaScript one-liner (not the most efficient :P)

const staircase = n => console.log(new Array(n).fill(0).map((_, idx) => "#".repeat(idx + 1).padStart(n)).join('\n'));

One of the best and easy solution

Thanks

Hello All,

There are a lot of sites and git hub repositories where you can find hackerRank solutions for most of the problems.

But I would recommend https://github.com/Java-aid/Hack... which is maintained by me. Here I may be biased but the trust me, you will find this repository useful.

In this repository, I am adding video tutorial too which you will not find in any of the git-hub repositories out there over the internet.

Here is the sample tutorial - https://youtu.be/gDltV7pJw7A

which will teach you an amazing approaches to solve hackerrank staircase problem. Please watch the complete tutorial to know a tricky method to solve this problem.

Here my goal is not only to provide the solution but to build the problem-solving skills. Would recommend you to go through the video tutorials which will increase your logical ability.

Don't forget to share your feedback with others, if you like my work. :)

Hello Coding Lover,

If you are looking for solution of hackerrank problems you can checkout the below link https://github.com/Java-aid/Hackerrank-Solutions.

It contains text solution as well as video explaination. Still there are many more solutions are in queue which needs to be added.

And if you are preparing for coding interview feel free to join out community here https://www.facebook.com/groups/codingip

Regards,

Kanahaiya Gupta

Git Hub URL | https://github.com/Java-aid/

LIKE US | https://www.facebook.com/javaaid/

SUBSCRIBE US | https://www.youtube.com/channel/UCx1hbK753l3WhwXP5r93eYA

Javacript Clean and Sexy using repeat method of strings

// Complete the staircase function below.

function staircase(n) {
    for (let i = 1; i <= n; i++){
        console.log(' '.repeat(n - i) + '#'.repeat(i));
    }
}

Why wont this be the correct output??? WHYY?

include

using namespace std;

// Complete the staircase function below. void staircase(int n) {int i,j,k; for(i=0;ii;j--) { cout<<" "; } for(k=0;k<=i;k++) { cout<<"#"; } cout<> n; cin.ignore(numeric_limits::max(), '\n'); staircase(n); return 0; }