Pattern PDF
Pattern PDF
There are also other types of patterns that do not use stars but
numbers or alphabets. We will also look at these in brief here.
Beginner
Pro
Beginner
Pro
Beginner
Pro
Beginner
Pro
Beginner
Pro
for i in range(n):
# internal loop run for n - i times
for j in range(n - i):
print('*', end='')
print()
Python
Output:
*****
****
***
**
*
There will be 2 loops of which the first one will print spaces 'n - 1' in
the first row, 'n - 2' in the second row, and so on and the second loop
will print stars '2*i - 1' in the first row, '2*i - 2' in the second row and so
on.
Beginner
Pro
So to create this pattern, first run a loop and print spaces. Then run
another loop that prints a star then a series of spaces and finally print
a star.
# hollow pyramid star pattern
n=5
for i in range(n):
# printing spaces
for j in range(n - i - 1):
print(' ', end='')
# printing stars
for k in range(2 * i + 1):
# print star at start and end of the row
if k == 0 or k == 2 * i:
print('*', end='')
else:
if i == n - 1:
print('*', end='')
else:
print(' ', end='')
print()
Python
Output:
*
* *
* *
* *
*********
# downward pyramid
for i in range(n - 1):
for j in range(i + 1):
print(' ', end='')
for j in range(2*(n - i - 1) - 1):
print('*', end='')
print()
Python
Output:
*
***
*****
*******
*********
*******
*****
***
*
# downward pyramid
for i in range(n - 1):
for j in range(i + 1):
print(' ', end='')
for j in range(2*(n - i - 1) - 1):
if j == 0 or j == 2*(n - i - 1) - 2:
print('*', end='')
else:
print(' ', end='')
print()
Python
Output:
*
* *
* *
* *
* *
* *
* *
* *
*
13. Hourglass Star Pattern In
Python
*********
*******
*****
***
*
***
*****
*******
*********
The hourglass pattern is a pattern with the shape of an hourglass.
When you observe the pattern, you will see that it is made up of two
patterns. The first pattern is a downward pyramid pattern and the
second pattern is an upward triangle pattern.
You can create this pattern by combining both patterns. The code is
as follows.
# hourglass star pattern
n=5
# downward pyramid
for i in range(n-1):
for j in range(i):
print(' ', end='')
for k in range(2*(n-i)-1):
print('*', end='')
print()
# upward pyramid
for i in range(n):
for j in range(n-i-1):
print(' ', end='')
for k in range(2*i+1):
print('*', end='')
print()
Python
Output:
*********
*******
*****
***
*
***
*****
*******
*********
Beginner
Pro
# upper triangle
for i in range(n):
for j in range(i + 1):
print('*', end="")
print()
# lower triangle
for i in range(n):
for j in range(n - i - 1):
print('*', end="")
print()
Python
Output:
*
**
***
****
*****
****
***
**
*
# lower triangle
for i in range(n - 1):
# print spaces
for j in range(i + 1):
print(' ', end='')
# print stars
for k in range(n - i - 1):
print('*', end='')
print()
Python
Output:
*
**
***
****
*****
****
***
**
*
# lower part
for i in range(n,0,-1):
for j in range(i, n, 1):
print(" ", end="")
for j in range(1, i*2, 1):
print("*", end="")
print()
Python
Output:
*** ***
***** *****
***********
*********
*******
*****
***
*
size = 5
for i in range(size):
for j in range(size):
if i == size // 2:
print('*', end='')
else:
if j == size // 2:
print('*', end='')
else:
print(' ', end='')
print()
Python
Output:
*
*
*****
*
*
for i in range(size):
for j in range(size):
if i == j or i + j == size - 1:
print("*", end="")
else:
print(" ", end="")
print()
Python
Output:
* *
* *
*
* *
* *
# upside pyramid
for i in range(1, size + 1):
# printing spaces
for j in range(size, i - 1, -1):
print(" ", end="")
# printing star
for k in range(0, i * 2 - 1):
print(num, end="")
num += 1
# set the number to 1
num = 1
print()
# downside pyramid
for i in range(1, size):
# printing spaces
for j in range(0, i+1):
print(" ", end="")
# printing star
for k in range((size - i) * 2 - 1):
print(num, end="")
num += 1
# set num to 1
num = 1
print()
Python
Output:
1
123
12345
1234567
123456789
1234567
12345
123
1
# downward pyramid
for i in range(size - 1):
for j in range(i + 1):
print(' ', end='')
for j in range(2*(size - i - 1) - 1):
if j == 0 or j == 2*(size - i - 1) - 2:
print(num, end='')
num += 1
else:
print(' ', end='')
# set num to 1
num = 1
print()
Python
Output:
1
1 2
1 2
1 2
1 2
1 2
1 2
1 2
1
for i in range(size):
# print spaces
for j in range(size - i):
print(" ", end="")
# print alphabets
for k in range(2 * i + 1):
print(chr(alpha + k), end="")
print()
Python
Output:
A
ABC
ABCDE
ABCDEFG
ABCDEFGHI
for i in range(size):
# print spaces
for j in range(i):
print(" ", end="")
# print alphabets
for k in range(2 * (size - i) - 1):
print(chr(alpha + k), end="")
print()
Python
Output:
ABCDEFGHI
ABCDEFG
ABCDE
ABC
A
28. Hollow Alphabet Pyramid
Pattern
The hollow alphabet pyramid pattern is a pyramid pattern that is made
of alphabets and is hollow inside.
A
BC
D E
F G
HIJKLMNOP
The complete code for the hollow alphabet pyramid pattern is given
below.
# hollow alphabet pyramid pattern
size = 5
alpha = 65
num = 0
for i in range(size):
for j in range(size - i - 1):
print(" ", end="")
for k in range(2 * i + 1):
if i == 0 or i == size - 1:
print(chr(alpha + num), end="")
num += 1
else:
if k == 0 or k == 2 * i:
print(chr(alpha + num), end="")
num += 1
else:
print(" ", end="")
print()
Python
Output:
A
B C
D E
F G
HIJKLMNOP
29. Alphabet Diamond Pattern
Program
The alphabet diamond pattern is a diamond pattern that is made of
alphabets.
A
ABC
ABCDE
ABCDEFG
ABCDEFGHI
ABCDEFG
ABCDE
ABC
A
The complete code for the alphabet diamond pattern is given below.
# alphabet diamond pattern
size = 5
alpha = 65
num = 0
# upside pyramid
for i in range(1, size + 1):
# printing spaces
for j in range(size, i - 1, -1):
print(" ", end="")
# printing alphabets
for k in range(0, i * 2 - 1):
print(chr(alpha + num), end="")
num += 1
num = 0
print()
#downward pyramid
for i in range(1, size):
# printing spaces
for j in range(0, i+1):
print(" ", end="")
# printing alphabets
for k in range((size - i) * 2 - 1):
print(chr(alpha + num), end="")
num += 1
num = 0
print()
Python
Output:
A
ABC
ABCDE
ABCDEFG
ABCDEFGHI
ABCDEFG
ABCDE
ABC
A
# downward pyramid
for i in range(size - 1):
for j in range(i + 1):
print(' ', end='')
for j in range(2*(size - i - 1) - 1):
if j == 0 or j == 2*(size - i - 1) - 2:
print(chr(alpha+num), end='')
num += 1
else:
print(' ', end='')
# set num to 0
num = 0
print()
Python
Output:
A
A B
A B
A B
A B
A B
A B
A B
A