All challenges
Medium 0 solved 0% acceptance

Butterfly Pattern

Print a butterfly: two star triangles facing each other that grow until they touch, then shrink again.

What you'll learn

  • Build a row from three parts: left wing, gap and right wing
  • Mirror a half to get the full shape
  • Spot the row where the gap disappears

Problem

The butterfly has 2n rows. In the top half, row i (i = 1 to n) is i stars, then 2(n − i) spaces, then i stars again, so the two wings meet in the middle on row n. The bottom half repeats the same rows in reverse order, from i = n back down to i = 1, so the widest row appears twice in the middle.

Implement butterfly_pattern(n).

Input

n: The number of rows in each half.

Output

Return the 2n rows from top to bottom. Every row ends with a star, so no row has trailing spaces. When n is 0, return an empty list.

Constraints

0 ≤ n ≤ 50

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

Top half: "* *", "** **", "******"; the bottom half is the same three rows reversed.

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

Each half is one row of 1 + 0 + 1 characters: ["**", "**"].

How to approach it

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

Hint 1

In the top half, row i has i stars on each side.

Hint 2

The gap shrinks by two each row and is empty on row n.

Hint 3

The bottom half is the top half in reverse, including row n again.

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.