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

Hollow Rhombus Star Pattern

Read summary with AI tools
Table of contents
  1. Output
  2. How the hollow rhombus star pattern works
  3. Program in C
  4. Program in C++
  5. Program in Java
  6. Program in Python
  7. Time and space complexity
  8. Related patterns

The outline of a left-leaning rhombus. This tutorial shows the output, a row-by-row diagram and the complete program in C, C++, Java and Python.

This program is part of the Star Patterns collection.

Hollow Rhombus Star Pattern output

Output (n = 5):

    *****
   *   *
  *   *
 *   *
*****
Hollow Rhombus Star Pattern layout diagram, row by row (n = 5)
How each row of the hollow rhombus star pattern is built (n = 5). Blue cells are printed characters; grey dots are spaces.

How the hollow rhombus star pattern works

Row i has n − i leading spaces, so its stars run from column n − i + 1 to 2n − i. Print a star on the first and last rows and at those two edge columns only.

  1. Run the outer loop for i from 1 to n, one row per pass.
  2. Go through 2 × n − i positions in the row. Print stars where j > n − i and (i = 1 or i = n or j = n − i + 1 or j = 2 × n − i); print spaces everywhere else.
  3. Move to the next line.

Hollow Rhombus Star Pattern in C

#include <stdio.h>

int main(void) {
    int n = 5;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= 2 * n - i; j++) {
            if (j > n - i && (i == 1 || i == n || j == n - i + 1 || j == 2 * n - i))
                printf("*");
            else
                printf(" ");
        }
        printf("\n");
    }
    return 0;
}

Hollow Rhombus Star Pattern in C++

#include <iostream>
using namespace std;

int main() {
    int n = 5;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= 2 * n - i; j++) {
            if (j > n - i && (i == 1 || i == n || j == n - i + 1 || j == 2 * n - i))
                cout << "*";
            else
                cout << " ";
        }
        cout << endl;
    }
    return 0;
}

Hollow Rhombus Star Pattern in Java

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

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= 2 * n - i; j++) {
                if (j > n - i && (i == 1 || i == n || j == n - i + 1 || j == 2 * n - i))
                    System.out.print("*");
                else
                    System.out.print(" ");
            }
            System.out.println();
        }
    }
}

Hollow Rhombus Star Pattern in Python

n = 5

for i in range(1, n + 1):
    for j in range(1, 2 * n - i + 1):
        if j > n - i and (i == 1 or i == n or j == n - i + 1 or j == 2 * n - i):
            print("*", end="")
        else:
            print(" ", 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.