New: 77 pattern programs with tested code in C, C++, Java and Python Explore patterns

Palindrome Number Diamond

Read summary with AI tools

A diamond where every row counts up to its middle and back down again. Below you will see how the pattern is built, followed by complete programs in C, C++, Java and Python.

This program is part of the Number Patterns collection.

Table of contents7 sections
  1. Output
  2. How the palindrome number diamond works
  3. Program in C
  4. Program in C++
  5. Program in Java
  6. Program in Python
  7. Time and space complexity

Palindrome Number Diamond output

Output (n = 5):

    1
   121
  12321
 1234321
123454321
 1234321
  12321
   121
    1
Palindrome Number Diamond layout diagram, row by row (n = 5)
How each row of the palindrome number diamond is built (n = 5). Blue cells are printed characters; grey dots are spaces.

How the palindrome number diamond works

Each row is a palindrome: 1 up to i, then i − 1 down to 1. The second half repeats the rows in reverse order, starting at n − 1.

  1. Run the outer loop for i from 1 to n, one row per pass (upper half).
  2. Print n − i spaces.
  3. Print i numbers (value j).
  4. Print i − 1 numbers (value i − j).
  5. Move to the next line.
  6. Run the outer loop for i from n − 1 down to 1, one row per pass (lower half).
  7. Print n − i spaces.
  8. Print i numbers (value j).
  9. Print i − 1 numbers (value i − j).
  10. Move to the next line.

Palindrome Number Diamond in C

#include <stdio.h>

int main(void) {
    int n = 5;

    // upper half
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n - i; j++)
            printf(" ");
        for (int j = 1; j <= i; j++)
            printf("%d", j);
        for (int j = 1; j <= i - 1; j++)
            printf("%d", i - j);
        printf("\n");
    }

    // lower half
    for (int i = n - 1; i >= 1; i--) {
        for (int j = 1; j <= n - i; j++)
            printf(" ");
        for (int j = 1; j <= i; j++)
            printf("%d", j);
        for (int j = 1; j <= i - 1; j++)
            printf("%d", i - j);
        printf("\n");
    }
    return 0;
}

Palindrome Number Diamond in C++

#include <iostream>
using namespace std;

int main() {
    int n = 5;

    // upper half
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n - i; j++)
            cout << " ";
        for (int j = 1; j <= i; j++)
            cout << j;
        for (int j = 1; j <= i - 1; j++)
            cout << i - j;
        cout << endl;
    }

    // lower half
    for (int i = n - 1; i >= 1; i--) {
        for (int j = 1; j <= n - i; j++)
            cout << " ";
        for (int j = 1; j <= i; j++)
            cout << j;
        for (int j = 1; j <= i - 1; j++)
            cout << i - j;
        cout << endl;
    }
    return 0;
}

Palindrome Number Diamond in Java

public class PalindromeNumberDiamond {
    public static void main(String[] args) {
        int n = 5;

        // upper half
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n - i; j++)
                System.out.print(" ");
            for (int j = 1; j <= i; j++)
                System.out.print(j);
            for (int j = 1; j <= i - 1; j++)
                System.out.print(i - j);
            System.out.println();
        }

        // lower half
        for (int i = n - 1; i >= 1; i--) {
            for (int j = 1; j <= n - i; j++)
                System.out.print(" ");
            for (int j = 1; j <= i; j++)
                System.out.print(j);
            for (int j = 1; j <= i - 1; j++)
                System.out.print(i - j);
            System.out.println();
        }
    }
}

Palindrome Number Diamond in Python

n = 5

# upper half
for i in range(1, n + 1):
    for j in range(1, n - i + 1):
        print(" ", end="")
    for j in range(1, i + 1):
        print(j, end="")
    for j in range(1, i):
        print(i - j, end="")
    print()

# lower half
for i in range(n - 1, 0, -1):
    for j in range(1, n - i + 1):
        print(" ", end="")
    for j in range(1, i + 1):
        print(j, end="")
    for j in range(1, i):
        print(i - j, end="")
    print()

Time and space complexity

The program prints one character for each position in the pattern, so for n rows it runs in O(n²) time. It only needs a few loop variables, so the extra memory is O(1).

Authored by

Ghanendra Yadav runs Pattern Programs from Bangalore, India. The site started in 2020 to help students practise loops and logic through pattern programs in C, C++, Java and Python. Every program published here is compiled and run before it goes live, and the output shown is the real output.

Latest articles

Leave a comment

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.