The hollow square with both diagonals drawn inside it. 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 Star Patterns collection.
Hollow Square Star Pattern with Diagonals output
Output (n = 7):
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *

How the hollow square star pattern with diagonals works
Add two more conditions to the hollow square: i == j for the main diagonal and i + j == n + 1 for the other diagonal. An odd n makes the diagonals meet in the centre.
- Run the outer loop for
ifrom1ton, one row per pass. - Go through
npositions in the row. Print stars wherei = 1 or i = n or j = 1 or j = n or i = j or i + j = n + 1; print spaces everywhere else. - Move to the next line.
Hollow Square Star Pattern with Diagonals in C
#include <stdio.h>
int main(void) {
int n = 7;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i == 1 || i == n || j == 1 || j == n || i == j || i + j == n + 1)
printf("* ");
else
printf(" ");
}
printf("\n");
}
return 0;
}Hollow Square Star Pattern with Diagonals in C++
#include <iostream>
using namespace std;
int main() {
int n = 7;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i == 1 || i == n || j == 1 || j == n || i == j || i + j == n + 1)
cout << "* ";
else
cout << " ";
}
cout << endl;
}
return 0;
}Hollow Square Star Pattern with Diagonals in Java
public class HollowSquareWithDiagonals {
public static void main(String[] args) {
int n = 7;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i == 1 || i == n || j == 1 || j == n || i == j || i + j == n + 1)
System.out.print("* ");
else
System.out.print(" ");
}
System.out.println();
}
}
}Hollow Square Star Pattern with Diagonals in Python
n = 7
for i in range(1, n + 1):
for j in range(1, n + 1):
if i == 1 or i == n or j == 1 or j == n or i == j or i + j == 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).





