Alphabet patterns in python
problem 1: sample input:5 sample output: A B C D E F G H I J K L M N O python code: import string x=string.ascii_uppercase k=0 n=int(input()) for i in range(n): for j in range(i+1): print(x[k],end=' ') k+=1 print('\r') problem 2: sample input:5 sample output: a b c d e f g h i j k l m n o python code: import string x=string.ascii_lowercase k=0 n=int(input()) for i in range(n): for j in range(i+1): print(x[k],end=' ') k+=1 print('\r') problem 3: sample input:5 sample output: A B B C C C D D D D E E E E E python code: import string x=string.ascii_uppercase k=0 n=int(input()) for i in range(n): for j in range(i+1): print(x[k],end=' ') k+=1 print('\r') problem ...