Instead of a fixed word, each row prints the alphabet from A up to the i-th letter. 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 String Patterns collection.
Alphabet Triangle output
Output (n = 5):
A A B A B C A B C D A B C D E

How the alphabet triangle works
Letters are consecutive character codes, so 'A' + j − 1 gives the j-th letter of the alphabet (in Python, chr(ord('A') + j − 1)).
- Run the outer loop for
ifrom1ton, one row per pass. - Print
iletters of the alphabet. - Move to the next line.
Alphabet Triangle 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++)
printf("%c ", 'A' + j - 1);
printf("\n");
}
return 0;
}Alphabet Triangle 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++)
cout << char('A' + j - 1) << " ";
cout << endl;
}
return 0;
}Alphabet Triangle in Java
public class AlphabetTriangle {
public static void main(String[] args) {
int n = 5;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++)
System.out.print((char) ('A' + j - 1) + " ");
System.out.println();
}
}
}Alphabet Triangle in Python
n = 5
for i in range(1, n + 1):
for j in range(1, i + 1):
print(chr(ord('A') + 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).





