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
Hollow Mirrored Rhombus Star Pattern output
Output (n = 5):
*****
* *
* *
* *
*****
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.
- Run the outer loop for
ifrom1ton, one row per pass. - Go through
i − 1 + npositions in the row. Print stars wherej ≥ i and (i = 1 or i = n or j = i or j = i + n − 1); print spaces everywhere else. - Move to the next line.
Key takeaways
- Row
i’s stars run from columnitoi + n − 1, so every row isnwide and starts one column later. j >= ikeeps the firsti − 1positions as spaces.- Only rows 1 and
nare 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.










