Easy 0 solved 0% acceptance

Hollow Pyramid

Print the outline of a centered pyramid: its two slanted sides and a solid base.

What you'll learn

  • Keep the outline of a centered shape
  • Treat the base and the tip as special rows
  • Avoid trailing spaces in output rows

Problem

Row i (counting from 1) of a centered pyramid has n − i leading spaces and a block of width 2i − 1. In the hollow version the last row (the base) stays fully filled with stars, a block of width 1 is a single *, and every other block keeps only its two end stars with spaces between them.

Implement hollow_pyramid(n).

Input

n: The number of rows.

Output

Return the rows from top to bottom, without trailing spaces.

Constraints

0 ≤ n ≤ 100

Examples

Example 1
Input:
n = 4

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

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

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

Explanation

Rows 2 and 3 keep only their ends, row 4 is the solid base of 7 stars: [" *", " * *", " * *", "*******"].

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

Row 2 is the base, so it is solid: [" *", "***"].

How to approach it

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

Hint 1

Leading spaces are the same as in the solid pyramid.

Hint 2

The tip has width 1 and the base is the last row; both are solid.

Hint 3

Any other row is a star, some spaces and a star.

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.