All challenges
Medium 0 solved 0% acceptance

Hourglass Pattern

Print an hourglass of stars: an inverted pyramid on top of an upright one, sharing the single-star waist.

What you'll learn

  • Combine an inverted pyramid with an upright one
  • Use the distance from the middle row to size each row
  • Avoid repeating the middle row

Problem

An hourglass narrows from 2n − 1 stars down to a single star in the middle row and then widens back out. It has 2n − 1 rows. Number the rows k = 1 to 2n − 1 and let d = |n − k| (so d goes n − 1, …, 1, 0, 1, …, n − 1). Row k has n − 1 − d leading spaces followed by 2d + 1 stars.

Implement hourglass_pattern(n).

Input

n: The number of rows in the top half, including the middle row.

Output

Return the 2n − 1 rows from top to bottom, without trailing spaces. When n is 0, return an empty list.

Constraints

0 ≤ n ≤ 100

Examples

Example 1
Input:
n = 3

Expected output:
expected = ["*****", " ***", "  *", " ***", "*****"]
Input:
long long n = 3;

Expected output:
std::vector<std::string> expected = {"*****", " ***", "  *", " ***", "*****"};
Input:
long n = 3;

Expected output:
string[] expected = new string[] {"*****", " ***", "  *", " ***", "*****"};

Explanation

Star counts are 5, 3, 1, 3, 5 and leading spaces 0, 1, 2, 1, 0: ["*****", " ***", " *", " ***", "*****"].

Example 2
Input:
n = 1

Expected output:
expected = ["*"]
Input:
long long n = 1;

Expected output:
std::vector<std::string> expected = {"*"};
Input:
long n = 1;

Expected output:
string[] expected = new string[] {"*"};

Explanation

Only the waist: ["*"].

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

The middle row has one star and n − 1 leading spaces.

Hint 2

The farther a row is from the middle, the more stars and the fewer spaces it has.

Hint 3

Count the rows: there are 2n − 1, not 2n.

Expected complexity

O(n^2) time, O(n^2) extra space

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

The best passing solution of each coder. Faster, smaller and better-reviewed solutions rank higher.

No passing solutions yet. Solve it to take first place.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.