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

Hollow Right Triangle Star Pattern

Read summary with AI tools
Table of contents
  1. Output
  2. How the hollow right triangle star pattern 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

Only the three sides of the right triangle. This tutorial shows the output, a row-by-row diagram and the complete program in C, C++, Java and Python.

This program is part of the Star Patterns collection.

Hollow Right Triangle Star Pattern output

Output (n = 5):

*
**
* *
*  *
*****
Hollow Right Triangle Star Pattern layout diagram, row by row (n = 5)
How each row of the hollow right triangle star pattern is built (n = 5). Blue cells are printed characters; grey dots are spaces.

How the hollow right triangle star pattern works

Row i has i positions. Print a star in the first column, the last column of the row (j == i) and on the last row; print a space everywhere else.

  1. Run the outer loop for i from 1 to n, one row per pass.
  2. Go through i positions in the row. Print stars where j = 1 or j = i or i = n; print spaces everywhere else.
  3. Move to the next line.

Hollow Right Triangle 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; j++) {
            if (j == 1 || j == i || i == n)
                printf("*");
            else
                printf(" ");
        }
        printf("\n");
    }
    return 0;
}

Hollow Right Triangle 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; j++) {
            if (j == 1 || j == i || i == n)
                cout << "*";
            else
                cout << " ";
        }
        cout << endl;
    }
    return 0;
}

Hollow Right Triangle Star Pattern in Java

public class HollowRightTriangleStar {
    public static void main(String[] args) {
        int n = 5;

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= i; j++) {
                if (j == 1 || j == i || i == n)
                    System.out.print("*");
                else
                    System.out.print(" ");
            }
            System.out.println();
        }
    }
}

Hollow Right Triangle Star Pattern in Python

n = 5

for i in range(1, n + 1):
    for j in range(1, i + 1):
        if j == 1 or j == i or i == n:
            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.