Easy 0 solved 0% acceptance

X Pattern

Draw both diagonals of an n by n square with stars to form an X.

What you'll learn

  • Recognise the two diagonals of a square by their coordinates
  • Build each row cell by cell
  • Trim trailing spaces from a row

Problem

Picture an n by n grid with rows and columns numbered from 0. The cell in row r and column c holds * when it lies on either diagonal, that is when c = r or c = n − 1 − r; every other cell is a space. Then each row has its trailing spaces removed. For odd n the diagonals cross in a single centre cell; for even n they pass between cells.

Implement x_pattern(n).

Input

n: The side length of the square.

Output

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

Constraints

0 ≤ n ≤ 100

Examples

Example 1
Input:
n = 5

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

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

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

Explanation

Row 0 has stars at columns 0 and 4, row 2 only at column 2: ["* *", " * *", " *", " * *", "* *"].

Example 2
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

Row 1 has stars at columns 1 and 2, which sit side by side: ["* *", " **", " **", "* *"].

How to approach it

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

Hint 1

The main diagonal is where the row equals the column.

Hint 2

The other diagonal is where the row and column add up to n − 1.

Hint 3

Remove trailing spaces after building each 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.