Medium 0 solved 0% acceptance

Number Diamond

Print a diamond whose rows count up from 1 to a peak and back down.

What you'll learn

  • Combine the diamond shape with palindromic rows
  • Fold the top and bottom halves into one loop
  • Center rows with leading spaces

Problem

This 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, then the digits 1, 2, …, m, then m − 1, …, 1, written next to each other with no spaces. The middle row is the longest, for example 12321 when n = 3.

Implement number_diamond(n).

Input

n: The number of rows in the top half, including the middle row (at most 9, so every number is one digit).

Output

Return the 2n − 1 rows from top to bottom, without trailing spaces. When n is 0, return an empty list.

Constraints

0 ≤ n ≤ 9

Examples

Example 1
Input:
n = 3

Expected output:
expected = ["  1", " 121", "12321", " 121", "  1"]
Input:
long long n = 3;

Expected output:
std::vector<std::string> expected = {"  1", " 121", "12321", " 121", "  1"};
Input:
long n = 3;

Expected output:
string[] expected = new string[] {"  1", " 121", "12321", " 121", "  1"};

Explanation

m goes 1, 2, 3, 2, 1: [" 1", " 121", "12321", " 121", " 1"].

Example 2
Input:
n = 2

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

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

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

Explanation

Three rows with m = 1, 2, 1: [" 1", "121", " 1"].

How to approach it

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

Hint 1

First work out the peak value m of each row: 1, 2, ..., n, ..., 2, 1.

Hint 2

A row with peak m counts from 1 up to m and back to 1.

Hint 3

The leading spaces depend only on m.

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.