Learn practical skills, build real-world projects, and advance your career
Created 3 years ago
def int_to_Roman(num):
val = [
1000, 900, 500, 400,
100, 90, 50, 40,
10, 9, 5, 4,
1
]
syb = [
"M", "CM", "D", "CD",
"C", "XC", "L", "XL",
"X", "IX", "V", "IV",
"I"
]
roman_num = ''
i = 0
while num > 0:
for _ in range(num // val[i]):
roman_num += syb[i]
num -= val[i]
i += 1
return roman_num
print(int_to_Roman(5))
print(int_to_Roman(3))
print(int_to_Roman(590))
def pali(n):
rev=str(n)[::-1]
if rev==str(n):
return 'Yes'
return 'No'
test=int(input())
for i in range(test):
x=int(input())
print(pali(x))
#panagram
def missingPanagram(s):
ori='abcdefghijklmnopqrstuvwxyz'
list1=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t',
'u','v','w','x','y','z','A']
list2=[]
x=''
if len(s)==len(ori):
return '-1'
else:
for i in s:
list2.append(i)
for j in list2:
if j.lower() in list1:
list1.remove(j)
x=(''.join(map(str,list1)))
y=(''.join(map(str,x)))
return y
if __name__ == "__main__":
t = int(input())
while(t>0):
s = input()
print(missingPanagram(s))
t = t-1
def str1(s,p):
x=s.find(p)
return (x)
str1('THIS IS A TEST TEXT','TEST')
10
#Check if strings are rotations of each other or not
def stri(s1,s2):
x=s1+s1
if len(s1)!=len(s2):
return False
print(x)
z=x.find(s2)
a=-1
if z==a:
return False
else:
return True
#stri('abcdefabcdef','defab')
stri('hacktoberfest','festhacktober')
hacktoberfesthacktoberfest
True