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

Hollow Mirrored Rhombus Star Pattern

Read summary with AI tools

A rhombus that leans the other way, with only its outline printed. Below you will see how the pattern is built, followed by complete programs in C, C++, Java and Python.

Quick answer: Loop over rows i = 1 to n and positions j = 1 to i − 1 + n. Print a star when j >= i and the position is on the border (first row, last row, j == i or j == i + n − 1); print a space otherwise. The outline leans to the right, one step per row.

This program is part of the Star Patterns collection.

Table of contents8 sections
  1. Output
  2. How the hollow mirrored 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. Frequently asked questions

Hollow Mirrored Rhombus Star Pattern output

Output (n = 5):

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

How the hollow mirrored rhombus star pattern works

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

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

Key takeaways

  • Row i’s stars run from column i to i + n − 1, so every row is n wide and starts one column later.
  • j >= i keeps the first i − 1 positions as spaces.
  • Only rows 1 and n are full; the others show their first and last star.
  • It is the mirror image of the hollow rhombus.

Hollow Mirrored 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 <= i - 1 + n; j++) {
            if (j >= i && (i == 1 || i == n || j == i || j == i + n - 1))
                printf("*");
            else
                printf(" ");
        }
        printf("\n");
    }
    return 0;
}

Hollow Mirrored 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 <= i - 1 + n; j++) {
            if (j >= i && (i == 1 || i == n || j == i || j == i + n - 1))
                cout << "*";
            else
                cout << " ";
        }
        cout << endl;
    }
    return 0;
}

Hollow Mirrored Rhombus Star Pattern in Java

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

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

Hollow Mirrored Rhombus Star Pattern in Python

n = 5

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

Frequently asked questions

Why does the inner loop run to i − 1 + n?

Row i starts with i − 1 spaces and then has n characters, so it ends at column i − 1 + n.

Why is j >= i needed?

It stops the first and last rows from filling the leading spaces with stars. On those rows every position passes the border test, so only j >= i keeps the indent.

Where is the filled version?

The mirrored rhombus star pattern prints i − 1 spaces and n stars on every row.

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.