Medium 0 solved 0% acceptance

Hollow Diamond

Print the outline of a diamond: only the first and last star of each row.

What you'll learn

  • Reuse the outline of a solid shape
  • Treat the width 1 row as a special case
  • Fill the inside of a row with spaces

Problem

Take the solid diamond with 2n − 1 rows: number the rows k = 1 to 2n − 1, let m = n − |n − k|, and give row k n − m leading spaces and a block of width 2m − 1. In the hollow version only the two ends of each block are * and everything between them is a space. A block of width 1 is a single *.

Implement hollow_diamond(n).

Input

n: The number of rows in the top half, including the widest 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

Widths are 1, 3, 5, 3, 1; the width 3 and 5 rows keep only their end stars: [" *", " * *", "* *", " * *", " *"].

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

A single block of width 1: ["*"].

How to approach it

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

Hint 1

Work out the width of each row exactly as for the solid diamond.

Hint 2

A row of width w has a star, w − 2 spaces and a star.

Hint 3

Check what that rule does when w is 1 and handle that row separately.

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.