The full word first, then one character shorter on every row. Below you will see how the pattern is built, followed by complete programs in C, C++, Java and Python.
Quick answer: Run the outer loop from i = n down to 1, where n is the length of the word, and print the first i characters on each row. The first row is the whole word, and every row after it drops the last letter: PROGRAM, PROGRA, PROGR … P.
This program is part of the String Patterns collection.
Table of contents8 sections
Inverted String Triangle output
Output (s = “PROGRAM”):
PROGRAM PROGRA PROGR PROG PRO PR P

How the inverted string triangle works
The same inner loop as the right triangle, but the outer loop counts i down from the length of the string to 1.
- Run the outer loop for
ifromndown to1, one row per pass. - Print
icharacters of the word. - Move to the next line.
Key takeaways
- It is the string right triangle with the outer loop counting down.
- Each row is still a prefix: it always starts with
s[0]. - The last row is the first letter on its own.
- The loop must stop at
i = 1, not 0, or the last row is an empty line.
Inverted String Triangle in C
#include <stdio.h>
#include <string.h>
int main(void) {
char s[] = "PROGRAM";
int n = strlen(s);
for (int i = n; i >= 1; i--) {
for (int j = 1; j <= i; j++)
printf("%c", s[j - 1]);
printf("\n");
}
return 0;
}Inverted String Triangle in C++
#include <iostream>
#include <string>
using namespace std;
int main() {
string s = "PROGRAM";
int n = s.length();
for (int i = n; i >= 1; i--) {
for (int j = 1; j <= i; j++)
cout << s[j - 1];
cout << endl;
}
return 0;
}Inverted String Triangle in Java
public class InvertedStringTriangle {
public static void main(String[] args) {
String s = "PROGRAM";
int n = s.length();
for (int i = n; i >= 1; i--) {
for (int j = 1; j <= i; j++)
System.out.print(s.charAt(j - 1));
System.out.println();
}
}
}Inverted String Triangle in Python
s = "PROGRAM"
n = len(s)
for i in range(n, 0, -1):
for j in range(1, i + 1):
print(s[j - 1], 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
How do I remove letters from the front instead?
Start each row later: print s[j − 1] for j from n − i + 1 to n. The rows become PROGRAM, ROGRAM, OGRAM … M.
Does it work with any word?
Yes. n = strlen(s) adapts the number of rows to the word stored in s.
Where is the growing version?
The string right triangle prints P, PR, PRO … PROGRAM.










