Skip to content
Open
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
15 changes: 15 additions & 0 deletions December 01/dec1.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,15 @@
def cricketScore(arr):
temp = 0
print(sum(arr))
for i in range(len(arr)):
if arr[temp] < arr[i]:
temp = i
print(temp)

def main():
n = int(input())
arr = input().split(" ")
arr = list(map(int, arr))
cricketScore(arr)

main()
11 changes: 11 additions & 0 deletions December 02/dec2.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,11 @@
def analyse(arr):
result = []
for i in set(arr):
result.append(arr.count(i))
return result
def main():
arr = input().split(" ")
arr = list(map(int,arr))
print(analyse(arr))

main()
15 changes: 15 additions & 0 deletions December 03/dec3.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,15 @@
def buildingHieght(arr):
count = 1
for i in range(1,len(arr)):
if arr[i-1] < arr[i]:
count+=1
return count

def main():
n = int(input())
Harr = []
for i in range(n):
h = int(input())
Harr.append(h)
print(buildingHieght(Harr))
main()
19 changes: 19 additions & 0 deletions December 04/dec4.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
def riddle(string):
shortPalindrome = ""
n = len(string)
for i in range(n):
for j in range(i+2,n+1):
if isPalindrome(string[i:j]) and (not shortPalindrome or len(string[i:j]) < len(shortPalindrome)):
shortPalindrome = string[i:j]
if shortPalindrome == "":
return "Error"
else:
return shortPalindrome

def isPalindrome(subString):
return subString == subString[::-1]

def main():
string = input()
print(riddle(string))
main()
13 changes: 13 additions & 0 deletions December 05/dec5.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,13 @@
def peakyBlinders(arr):
avg = sum(arr)/len(arr)
total = 0
for i in arr :
if i >= avg:
total += i
return total

def main():
arr = list(map(int,input().split(" ")))
print(peakyBlinders(arr))

main()
29 changes: 29 additions & 0 deletions December 06/dec6.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,29 @@
def scrolls(arr):
result = []
i = 0
temp = ""
while i<len(arr):
count = 0
if i == 0:
temp = arr[i]
result.append(arr[i])
i+=1
else:

if arr[i]!=temp:

for chr1, chr2 in zip(arr[i],temp):
if chr1 != chr2:
count +=1
if count == 1 and arr[i] not in result and len(temp) == len(arr[i]):
result.append(arr[i])
temp = arr[i]
i+=1
return result

arr = ["cat", "cot", "dot", "dog", "cog", "coat", "doll"]

print(scrolls(arr))



14 changes: 14 additions & 0 deletions December 07/dec 7.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,14 @@
from math import sqrt

def rectangleInCircle(a,b,c):
if sqrt((a**2)+(b**2)) > 2*c:
return False
else:
return True

def main():
a = int(input())
b = int(input())
c = int(input())
print(rectangleInCircle(a,b,c))
main()
39 changes: 39 additions & 0 deletions December 08/dec8.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,39 @@
def find_path(n):
matrix = []
for i in range(n):
x=[]
for j in range(n):
x.append(0)
matrix.append(x)
x=n//2
y=-1
matrix[x][y] = 1
x=n//2-1
y=0
for i in range(2,(n**2)+1):
if x == -n-1:
x= 0
if y == n:
y=0
while matrix[x][y] !=0:
x+=1
y-=2
if y <= -n-1:
y=-2
if x==n:
x=0

matrix[x][y] = i
x -= 1
y += 1
return matrix
print(find_path(3))









6 changes: 6 additions & 0 deletions December 09/dec9.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,6 @@
def camel(s):
count =0
for i in s:
if i.isupper():
count+=1
return count
21 changes: 21 additions & 0 deletions December 10/dec10.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
def forgot(cmd):
cmd = cmd.split(" ")
lower, upper = int(cmd[1].split(",")[1]) , int(cmd[1].split(",")[-1].rstrip(")"))
a = "Shivanash Kumar"
b = "Ragul Gupta"
oa = a[lower-1: upper+1]
ob = b[lower-1:upper+1]
if len(oa) >= len(ob) and len(oa) >= 23:
l = len(oa)
elif len(ob) >= len(oa) and len(ob) >= 23:
l = len(ob)
else:
l = 23
print("+"+"-"*l+"+")
print(f"| substring(empname,{lower},{upper})"+" "*(l-23)+"|")
print(f"| {oa}"+" "*(l-len(oa)-1)+ "|")
print(f"| {ob}"+" "*(l-len(ob)-1)+"|")
print("+"+"-"*l+"+")
forgot("select substring(empname,2,2) from emp;")