---
title: "Discussion on \"HackerRank Staircase\" | Hashnode"
description: "Discussion on \"HackerRank Staircase\". Problem\nConsider a staircase of size n = 4:\n   #\n  ##\n ###\n####\nWrite a program that prints a staircase of size n.\nSolution\nFor every n size there are n elements to print which makes the overall complexity O(N^2).\nNaive solution\nIn the simple case st..."
url: "https://hashnode.com/posts/hackerrank-staircase/5d9ea5a2d7abec6c7987e2ac"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [HackerRank Staircase](https://dustinkingen.hashnode.dev/hackerrank-staircase?utm_source=hashnode&utm_medium=feed)

Problem Consider a staircase of size n = 4: # ## ### #### Write a program that prints a staircase of size n. Solution For every n size there are n elements to print which makes the overall complexity O(N^2). Naive solution In the simple case st...

Oct 10, 2019 · dustinkingen.hashnode.dev  
Read the article

-   [#computer-science](https://hashnode.com/tag/computer-science)
-   [#competitive-programming](https://hashnode.com/tag/competitive-programming)

## Written by

[Dustin Kingen](https://hashnode.com/@DustinKingen)

@DustinKingen · Michigan, US

  
[View profile](https://hashnode.com/@DustinKingen)

Senior Software Engineer

## Responses

Markdown supported · ⌘↵ to post

No responses yet.
