Medium 0 solved 0% acceptance

Diamond Pattern

Print a solid diamond of stars made of a pyramid and its mirror image.

What you'll learn

  • Split a symmetric shape into a growing and a shrinking half
  • Use an absolute value to fold two loops into one
  • Center rows with leading spaces

Problem

A diamond is a centered pyramid with an upside-down copy below it that shares the widest row. For a given n the diamond has 2n − 1 rows. Number the rows k = 1 to 2n − 1 and let m = n − |n − k|, so m goes 1, 2, …, n, …, 2, 1. Row k has n − m leading spaces followed by 2m − 1 stars.

Implement diamond_pattern(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

Five rows with 1, 3, 5, 3, 1 stars and 2, 1, 0, 1, 2 leading spaces: [" *", " ***", "*****", " ***", " *"].

Example 2
Input:
n = 2

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

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

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

Explanation

Three rows: one star after a space, three stars, one star after a space: [" *", "***", " *"].

How to approach it

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

Hint 1

Draw the top half first; it is the centered pyramid you may already know.

Hint 2

The bottom half is the top half without its last row, in reverse order.

Hint 3

Alternatively, |n − k| tells you how far row k is from the middle row.

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.