The mirrored hollow parallelogram star pattern is the outline of a slanted rectangle that leans to the right: every row starts one column further in than the row above.
Quick answer: Row i starts with i − 1 spaces and its block covers columns i to 2n + i − 1. Print the first and last rows in full; on the other rows print a star only at the two ends of the block.
This program is part of the Star Patterns collection.
Table of contents8 sections
Mirrored Hollow Parallelogram Star Pattern output
Output (4 rows, 8 columns):
******** * * * * ********

How the mirrored hollow parallelogram star pattern works
Compared with the hollow parallelogram, only the indent changes direction: it grows by one each row instead of shrinking. So the block for row i starts at column i, and its end is 2n − 1 columns later. The hollow test is unchanged.
- Run the outer loop for
ifrom1ton, one row per pass. - Go through
2 × n + i − 1positions in the row. Print stars wherej ≥ i and (i = 1 or i = n or j = i or j = 2 × n + i − 1); print spaces everywhere else. - Move to the next line.
Key takeaways
- The indent
i − 1grows, so the shape leans right. - The block for row
iruns from columnito2n + i − 1. - Top and bottom rows are full; the rows between show only the two ends.
- It is the hollow outline of the mirrored parallelogram.
Mirrored Hollow Parallelogram Star Pattern in C
#include <stdio.h>
int main(void) {
int n = 4;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= 2 * n + i - 1; j++) {
if (j >= i && (i == 1 || i == n || j == i || j == 2 * n + i - 1))
printf("*");
else
printf(" ");
}
printf("\n");
}
return 0;
}Mirrored Hollow Parallelogram Star Pattern in C++
#include <iostream>
using namespace std;
int main() {
int n = 4;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= 2 * n + i - 1; j++) {
if (j >= i && (i == 1 || i == n || j == i || j == 2 * n + i - 1))
cout << "*";
else
cout << " ";
}
cout << endl;
}
return 0;
}Mirrored Hollow Parallelogram Star Pattern in Java
public class MirroredHollowParallelogramStar {
public static void main(String[] args) {
int n = 4;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= 2 * n + i - 1; j++) {
if (j >= i && (i == 1 || i == n || j == i || j == 2 * n + i - 1))
System.out.print("*");
else
System.out.print(" ");
}
System.out.println();
}
}
}Mirrored Hollow Parallelogram Star Pattern in Python
n = 4
for i in range(1, n + 1):
for j in range(1, 2 * n + i):
if j >= i and (i == 1 or i == n or j == i or j == 2 * n + i - 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
What is the difference from the mirrored hollow rhombus?
A rhombus has all four sides the same length: n rows and n stars wide. This parallelogram is 2n stars wide, so it looks like a slanted rectangle.
How do I make it taller but not wider?
Use separate variables for the height and width: rows 1 to h and a block of w columns. Replace n in the row loop with h and 2n with w.
How do I let the user choose the size?
Read n from the keyboard instead of fixing it in the code: scanf("%d", &n); in C, cin >> n; in C++, new Scanner(System.in).nextInt() in Java and int(input()) in Python.











