All challenges
Easy 0 solved 0% acceptance

Inverted Pyramid

Print a centered pyramid of stars upside down, with the widest row on top.

What you'll learn

  • Count spaces up while stars count down
  • Express a row's width with a formula in the row number
  • Avoid trailing spaces in output rows

Problem

Turn the centered pyramid over: the top row is the widest, with 2n − 1 stars, and each row below is two stars narrower and shifted one space further right, until the last row holds a single *. Row i (counting from 1) has i − 1 leading spaces followed by 2(n − i) + 1 stars.

Implement inverted_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 = 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

Row 1 has 0 spaces and 5 stars, row 2 has 1 space and 3 stars, row 3 has 2 spaces and 1 star: ["*****", " ***", " *"].

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

One row with one star: ["*"].

How to approach it

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

Hint 1

Write the rows for n = 3 and count the spaces and stars on each.

Hint 2

Spaces grow by one per row while stars shrink by two.

Hint 3

The last row always has exactly one 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.