Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 8 additions & 0 deletions Week 1/SET 14 -Week 1/ques1.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
n = int(input())

for i in range(1,n+1) :
if i%5==0:
continue
if i*i == n:
break
print(i)
25 changes: 25 additions & 0 deletions Week 1/SET 14 -Week 1/ques2.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,25 @@
def encrypt(text,s):
result = ""

for i in range(len(text)):
char = text[i]

if (char.isupper()):
result += chr((ord(char) + s-65) % 26 + 65)

else:
result += chr((ord(char) + s - 97) % 26 + 97)

return result

#check the above function
text = input()
s = int(input())
print("OLD SENTENCE IS : ")
print(text)

words = text.split()

print("NEW SENTENCE IS : ")
for i in words:
print(encrypt(i,s),end=" ")
8 changes: 8 additions & 0 deletions Week 1/SET 14 -Week 1/ques3.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
def modify(s):
if s[0].isupper() ==True:
print(s.upper())
else:
print(s.lower())

s = input()
modify(s)
10 changes: 10 additions & 0 deletions Week 1/SET 14 -Week 1/ques4.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,10 @@
def sumofDigits(n):
sum = 0
for digit in str(n):
sum += int(digit)
print(sum)

n =input()
sumofDigits(n)


26 changes: 26 additions & 0 deletions Week 1/SET 14 -Week 1/ques5.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,26 @@
def MaxZero(ar,n) :
l=[int(x) for x in ar.split()]
z=0
maxz=0
maxval=0
for x in l:
s=str(x)
no=[int(y) for y in s]
z=no.count(0)
if maxz<z:
maxz=z
maxval=x
elif maxz==z and maxz!=0:
maxval=max(maxval,x)
del no
if maxz==0:
print(-1)
else:
print(maxval)

n=int(input())
ar=input()
MaxZero(ar,n)



13 changes: 13 additions & 0 deletions Week 2/SET 14 -Week 2/ques1.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
def ispangram(str):
alphabet = "abcdefghijklmnopqrstuvwxyz"
for char in alphabet:
if char not in str.lower():
return False

return True

str = input("enter a sentence :\n ")
if ispangram(str):
print('contains all alphabets')
else:
print('does not contain all alphabets')
8 changes: 8 additions & 0 deletions Week 2/SET 14 -Week 2/ques2.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
arr = tuple(map(int,input().split()))

adderp = sum(list(filter(lambda x: (x>= 0) , arr)))
addernp = sum(list(filter(lambda x: (x<0) , arr)))

print(adderp)
print(addernp)

3 changes: 3 additions & 0 deletions Week 2/SET 14 -Week 2/ques3.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,3 @@
arr = [int(x) for x in input().split()]
test_list = list(set(arr))
print(test_list)
8 changes: 8 additions & 0 deletions Week 2/SET 14 -Week 2/ques4.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
tuple1 = tuple(map(int,input().split()))
tuple2 = tuple(map(int,input().split()))
tuple3 = tuple(map(int,input().split()))

adder = tuple(map(lambda x, y, z: (x + y + z)//3, tuple1, tuple2, tuple3))

print(adder)

8 changes: 8 additions & 0 deletions Week 2/SET 14 -Week 2/ques5.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
my_dict = {1:'Apple', 2:'Oracle',3:'Advanced Programming Practice',4:'Software Project Management', 5:'Fundamentals of mathematics'}

for x in range(1,6):
#print(my_dict[i])
test_str = my_dict[x]
res = {i : test_str.count(i) for i in set(test_str)}
print(res)

19 changes: 19 additions & 0 deletions Week 3/SET 14 -Week 3/ques1.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
class ques1:

def __init__(self):
pass

def twoSum(self, nums, target):
lookup = {}
for i, num in enumerate(nums):
if target - num in lookup:
return (lookup[target - num], i )
lookup[num] = i

arr = [int(x) for x in input().split()]
target = int(input())
obj = ques1()
index1,index2 = obj.twoSum(arr, target)
print (index1 + 1)
print (index2 + 1)
#print("index1=%d, index2=%d" % py_solution().twoSum((10,20,10,40,50,60,70),50))
16 changes: 16 additions & 0 deletions Week 3/SET 14 -Week 3/ques2.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,16 @@
class ques2:

def __init__(self):
pass

def _getString(self):
s = input()
return s

def _printString(self,s):
print(s.upper())

obj = ques2()
s = obj._getString()
obj._printString(s)

13 changes: 13 additions & 0 deletions Week 3/SET 14 -Week 3/ques3.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
class ques3():

def __init__(self, l, w):
self.length = l
self.width = w

def rectangle_area(self):
return self.length*self.width

l = int(input())
w = int(input())
obj = ques3(l,w)
print(obj.rectangle_area())
17 changes: 17 additions & 0 deletions Week 3/SET 14 -Week 3/ques4.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,17 @@
class ques4:
def __init__(self) -> None:
pass

def is_valid_parenthese(self, str1):
stack, pchar = [], {"(": ")", "{": "}", "[": "]"}
for parenthese in str1:
if parenthese in pchar:
stack.append(parenthese)
elif len(stack) == 0 or pchar[stack.pop()] != parenthese:
return False
return len(stack) == 0

obj = ques4()
s = input()
ans = obj.is_valid_parenthese(s)
print(ans)
14 changes: 14 additions & 0 deletions Week 3/SET 14 -Week 3/ques5.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
class ques5:
def sub_sets(self, sset):
return self.subsetsRecur([], sorted(sset))

def subsetsRecur(self, current, sset):
if sset:
return self.subsetsRecur(current, sset[1:]) + self.subsetsRecur(current + [sset[0]], sset[1:])
return [current]

obj = ques5()
arr = [int(x) for x in input().split()]
ans = obj.sub_sets(arr)
print(ans)