⚡ TL;DR
Print the alphabet pyramid pattern in Python. Complete working code, expected output, algorithm explanation, and practice variations for beginners learning loops.
The Alphabet Pyramid pattern is a classic loop exercise. Here’s the complete implementation in Python with working code and output.
Pattern to Print
A
ABA
ABCBA
ABCDCBA
ABCDEDCBAImplementation
def alphabet_pyramid(n):
for i in range(1, n + 1):
letters = ''.join(chr(64 + j) for j in range(1, i + 1))
print(" " * (n - i) + letters + letters[-2::-1])
alphabet_pyramid(5)Output
A
ABA
ABCBA
ABCDCBA
ABCDEDCBAHow It Works
Each row prints ascending letters A..X followed by descending X-1..A, centered with spaces. Uses ASCII arithmetic (A = 65).
Practice Variations
- Try printing the pattern with a different character (e.g.,
#or+) - Modify the code to accept the pattern size as user input
- Combine this pattern with its inverse to create a more complex shape
Complexity
- Time: O(n²) — the grid or line count grows quadratically
- Space: O(1) — only loop counters are needed
Related Patterns
- Alphabet Pyramid in Dart
- Alphabet Pyramid in Go
- Alphabet Pyramid in Swift
- Letter Diamond in Python
- Alphabet Hollow Diamond in Python
- Repeated Letter Rows in Python
FAQ
How do you print the Alphabet Pyramid pattern in Python?
Use nested loops: the outer loop walks through the rows while the inner loop prints the characters or values for each row. The complete Python implementation with expected output is shown in the sections above.
What is the time complexity of the Alphabet Pyramid pattern in Python?
The time complexity is O(n²) and the space complexity is O(1), since the pattern is built with a fixed number of loop counters and printed row by row.
Happy coding!
