Only the outline of a diamond. The logic is explained step by step, and the full program is given in C, C++, Java and Python.
This program is part of the Tricky Patterns collection.
Hollow Diamond Star Pattern output
Output (n = 5):
*
* *
* *
* *
* *
* *
* *
* *
*
How the hollow diamond star pattern works
Like the hollow pyramid, but without the solid bottom row: a star only at j = n − i + 1 and j = n + i − 1. The lower half repeats this with i going from n − 1 down to 1.
- Run the outer loop for
ifrom1ton, one row per pass (upper half). - Go through
n + i − 1positions in the row. Print stars wherej = n − i + 1 or j = n + i − 1; print spaces everywhere else. - Move to the next line.
- Run the outer loop for
ifromn − 1down to1, one row per pass (lower half). - Go through
n + i − 1positions in the row. Print stars wherej = n − i + 1 or j = n + i − 1; print spaces everywhere else. - Move to the next line.
Hollow Diamond Star Pattern 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 - 1; j++) {
if (j == n - i + 1 || j == n + i - 1)
printf("*");
else
printf(" ");
}
printf("\n");
}
// lower half
for (int i = n - 1; i >= 1; i--) {
for (int j = 1; j <= n + i - 1; j++) {
if (j == n - i + 1 || j == n + i - 1)
printf("*");
else
printf(" ");
}
printf("\n");
}
return 0;
}Hollow Diamond Star Pattern 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 - 1; j++) {
if (j == n - i + 1 || j == n + i - 1)
cout << "*";
else
cout << " ";
}
cout << endl;
}
// lower half
for (int i = n - 1; i >= 1; i--) {
for (int j = 1; j <= n + i - 1; j++) {
if (j == n - i + 1 || j == n + i - 1)
cout << "*";
else
cout << " ";
}
cout << endl;
}
return 0;
}Hollow Diamond Star Pattern in Java
public class HollowDiamondStar {
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 - 1; j++) {
if (j == n - i + 1 || j == n + i - 1)
System.out.print("*");
else
System.out.print(" ");
}
System.out.println();
}
// lower half
for (int i = n - 1; i >= 1; i--) {
for (int j = 1; j <= n + i - 1; j++) {
if (j == n - i + 1 || j == n + i - 1)
System.out.print("*");
else
System.out.print(" ");
}
System.out.println();
}
}
}Hollow Diamond Star Pattern in Python
n = 5
# upper half
for i in range(1, n + 1):
for j in range(1, n + i):
if j == n - i + 1 or j == n + i - 1:
print("*", end="")
else:
print(" ", end="")
print()
# lower half
for i in range(n - 1, 0, -1):
for j in range(1, n + i):
if j == n - i + 1 or j == 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).





