All challenges
Medium 0 solved 0% acceptance

Palindromic Number Pyramid

Print a centered pyramid where each row counts up to its row number and back down.

What you'll learn

  • Build a row from an ascending and a descending run
  • Center rows with leading spaces
  • Recognise a palindrome by its mirror symmetry

Problem

Each row of this pyramid reads the same forwards and backwards. Row i (counting from 1) has n − i leading spaces, then the digits 1, 2, …, i, then i − 1, …, 2, 1, all written next to each other with no spaces in between. So row 3 is 12321 and row 1 is 1.

Implement palindromic_number_pyramid(n).

Input

n: The number of rows (at most 9, so every number is a single digit).

Output

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

Constraints

0 ≤ n ≤ 9

Examples

Example 1
Input:
n = 3

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

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

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

Explanation

Row 1 is 2 spaces and 1, row 2 is 1 space and 121, row 3 is 12321: [" 1", " 121", "12321"].

Example 2
Input:
n = 1

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

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

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

Explanation

One row with the digit 1: ["1"].

How to approach it

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

Hint 1

Split each row into an up part 1..i and a down part i − 1..1.

Hint 2

The down part is the up part reversed without its last digit.

Hint 3

Leading spaces follow the same rule as in the star pyramid.

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.