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

Hollow Square Star Pattern with Diagonals

Read summary with AI tools
Table of contents
  1. Output
  2. How the hollow square star pattern with diagonals works
  3. Program in C
  4. Program in C++
  5. Program in Java
  6. Program in Python
  7. Time and space complexity
  8. Related patterns

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):

* * * * * * *
* *       * *
*   *   *   *
*     *     *
*   *   *   *
* *       * *
* * * * * * *
Hollow Square Star Pattern with Diagonals layout diagram, row by row (n = 7)
How each row of the hollow square star pattern with diagonals is built (n = 7). Blue cells are printed characters; grey dots are spaces.

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.

  1. Run the outer loop for i from 1 to n, one row per pass.
  2. Go through n positions in the row. Print stars where i = 1 or i = n or j = 1 or j = n or i = j or i + j = n + 1; print spaces everywhere else.
  3. 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).

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.