Python For Loops
Master Python with 70+ Hands-on Projects and Get Job-ready - Learn Python
Program 1
# Program related with for loop
# For loop with range function
# for i in range(1,11,1):
# print(i)
# for i in range(10,0,-1):
# print(i)
# For loop with colection
# mylist=[1,2,3,4,5,6,7,8,9,10]
# sum=0
# for i in mylist:
# print(i)
# sum+=i
# print("Total is ",sum)
# for loop with string
s=input("Enter a string")
count=0
for m in s:
#print(i,end="")
if(m=='a' or m=='A' or m=='e' or m=='E' or m=='i' or m=='I' or m=='o' or m=='O' or m=='u' or m=='U' ):
count=count+1
print("Total Vowel: ",count)
Program 2
# For loop Table of number
# n=int(input("Enter a number"))
# for i in range(1,11,1):
# print(n*i)
#Square of number
n=int(input("Enter the limit"))
for i in range(1,n+1,1):
print(i*i)Program 3
# Nested loop
# for i in range(1,6,1):
# for j in range(1,4,1):
# print(i," ", j)
# Pyramid of start
# n=int(input("Enter the limit"))
# for i in range(1,n+1,1):
# for j in range(1,i+1,1):
# print("*",end="")
# print()
# # Pyramid of Number 1
# n=int(input("Enter the limit"))
# for i in range(1,n+1,1):
# for j in range(1,i+1,1):
# print(i,end="")
# print()
## Pyramid of Number 2
# n=int(input("Enter the limit"))
# for i in range(1,n+1,1):
# for j in range(1,i+1,1):
# print(j,end="")
# print()
# n=int(input("Enter the limit"))
# if(n>26):
# print("Invalid limit")
# else:
# for i in range(1,n+1,1):
# asc_value=65
# for j in range(1,i+1,1):
# print(chr(asc_value),end="")
# asc_value+=1
# print()
# # Reverse Pyramid program
# n=int(input("Enter the limit"))
# for i in range(n,0,-1):
# for j in range(1,i+1,1):
# print("*",end="")
# print()
# # Reverse Pyramid program for number
# n=int(input("Enter the limit"))
# for i in range(n,0,-1):
# for j in range(1,i+1,1):
# print(i,end="")
# print()
# Reverse Pyramid program for number
n=int(input("Enter the limit"))
for i in range(n,0,-1):
for j in range(1,i+1,1):
print(j,end="")
print()
Did you know we work 24x7 to provide you best tutorials
Please encourage us - write a review on Google

