HackerRank Python Solutions

HackerRank Python Solutions/BasicDataTypes/Findingthepercentage.py

@@ -0,0 +1,10 @@
+if __name__ == '__main__':
+    n = int(input())
+    student_marks = {}
+    for _ in range(n):
+        name, *line = input().split()
+        scores = list(map(float, line))
+        student_marks[name] = scores
+    query_name = input()
+    res = sum(student_marks[query_name]) / len(student_marks[name])
+    print("{:.2f}".format(res))

HackerRank Python Solutions/BasicDataTypes/FindtheSecondLargestNumber.py

@@ -0,0 +1,5 @@
+
+if __name__ == '__main__':
+    n = int(input())
+    arr = map(int, input().split())
+    print(sorted(set(arr), reverse=True)[1])

HackerRank Python Solutions/BasicDataTypes/ListComprehensions.py

@@ -0,0 +1,9 @@
+
+if __name__ == '__main__':
+    x = int(input())
+    y = int(input())
+    z = int(input())
+    n = int(input())
+    ar = [[i, j, k] for i in range(x + 1) for j in range(y + 1) for k in
+          range(z + 1) if i + j + k != n]
+    print(ar)

HackerRank Python Solutions/BasicDataTypes/Lists.py

@@ -0,0 +1,33 @@
+
+
+if __name__ == '__main__':
+    N = int(input())
+    ar = []
+    for i in range(0, N):
+        tmp_str = input()
+        tmp_str_ar = tmp_str.strip().split(" ")
+        cmd = tmp_str_ar[0]
+        if cmd == "print":
+            print(ar)
+        elif cmd == "sort":
+            ar.sort()
+        elif cmd == "reverse":
+            ar.reverse()
+        elif cmd == "pop":
+            ar.pop()
+        elif cmd == "count":
+            val = int(tmp_str_ar[1])
+            ar.count(val)
+        elif cmd == "index":
+            val = int(tmp_str_ar[1])
+            ar.index(val)
+        elif cmd == "remove":
+            val = int(tmp_str_ar[1])
+            ar.remove(val)
+        elif cmd == "append":
+            val = int(tmp_str_ar[1])
+            ar.append(val)
+        elif cmd == "insert":
+            pos = int(tmp_str_ar[1])
+            val = int(tmp_str_ar[2])
+            ar.insert(pos, val)

HackerRank Python Solutions/BasicDataTypes/NestedLists.py

@@ -0,0 +1,14 @@
+
+if __name__ == '__main__':
+    students = []
+    scores = []
+    for _ in range(int(input())):
+        name = input()
+        score = float(input())
+        student = [name, score]
+        students.append(student)
+        scores.append(score)
+    second_min_score = sorted(set(scores))[1]
+    student_names = sorted(
+        [student[0] for student in students if student[1] == second_min_score])
+    print("\n".join(student_names))

HackerRank Python Solutions/BasicDataTypes/Tuples.py

@@ -0,0 +1,6 @@
+
+if __name__ == '__main__':
+    n = int(input())
+    integer_list = map(int, input().split())
+    t = tuple(integer_list)
+    print(hash(t))

HackerRank Python Solutions/BuiltIns/AnyorAll.py

@@ -0,0 +1,4 @@
+
+n = input()
+ar = input().split()
+print(all([int(i)>0 for i in ar]) and any([i==i[::-1] for i in ar]))

HackerRank Python Solutions/BuiltIns/AthleteSort.py

@@ -0,0 +1,14 @@
+
+
+if __name__ == '__main__':
+    n, m = map(int, input().split())
+
+    arr = []
+
+    for _ in range(n):
+        arr.append(list(map(int, input().rstrip().split())))
+
+    k = int(input())
+
+    for i in sorted(arr, key= lambda x: x[k]):
+        print(*i)

HackerRank Python Solutions/BuiltIns/Input.py

@@ -0,0 +1,5 @@
+
+if __name__ == "__main__":
+    x, k = map(int, input().strip().split())
+    equation = input().strip()
+    print(eval(equation) == k)

HackerRank Python Solutions/BuiltIns/PythonEvaluation.py

@@ -0,0 +1,2 @@
+
+eval(input())

HackerRank Python Solutions/BuiltIns/Zipped.py

@@ -0,0 +1,8 @@
+
+
+N, X = map(int, input().split())
+scores = []
+for _ in range(X):
+    scores.append(list(map(float, input().split())))
+for i in zip(*scores):
+    print(sum(i)/len(i))

HackerRank Python Solutions/BuiltIns/ginortS.py

@@ -0,0 +1,4 @@
+
+
+s = input()
+print(''.join(sorted(s, key=lambda x: (x.isdigit() and int(x)%2==0, x.isdigit(), x.isupper(), x.islower(), x))))

HackerRank Python Solutions/Classes/Class2FindtheTorsionalAngle.py

@@ -0,0 +1,37 @@
+import math
+
+
+
+class Points:
+    def __init__(self, x, y, z):
+        self.x = x
+        self.y = y
+        self.z = z
+
+    def __sub__(self, other):
+        return Points(self.x - other.x, self.y - other.y, self.z - other.z)
+
+    def dot(self, other):
+        return self.x * other.x + self.y * other.y + self.z * other.z  
+
+    def absolute(self):
+        return math.sqrt(self.x * self.x + self.y * self.y + self.z * self.z)
+
+    def cross(self, other):
+        return Points(self.y * other.z - self.z * other.y,
+            self.z * other.x - self.x * other.z,
+            self.x * other.y - self.y * other.x)
+
+
+if __name__ == '__main__':
+    points = list()
+    for i in range(4):
+        a = list(map(float, input().split()))
+        points.append(a)
+
+    a, b, c, d = Points(*points[0]), Points(*points[1]), Points(*points[2]), Points(*points[3])
+    x = (b - a).cross(c - b)
+    y = (c - b).cross(d - c)
+    angle = math.acos(x.dot(y) / (x.absolute() * y.absolute()))
+
+    print("%.2f" % math.degrees(angle))

HackerRank Python Solutions/Classes/ClassesDealingwithComplexNumbers.py

@@ -0,0 +1,46 @@
+
+import math
+
+
+
+class Complex():
+    def __init__(self, real, imaginary):
+        self.real = real
+        self.imaginary = imaginary
+
+    def __add__(self, no):
+        return Complex(self.real + no.real, self.imaginary + no.imaginary)
+
+    def __sub__(self, no):
+        return Complex(self.real - no.real, self.imaginary - no.imaginary)
+
+    def __mul__(self, no):
+        return Complex(self.real * no.real - self.imaginary * no.imaginary, self.real * no.imaginary + self.imaginary * no.real)
+
+    def __truediv__(self, no):
+        divider = no.real ** 2 + no.imaginary ** 2
+        return Complex((self.real * no.real + self.imaginary * no.imaginary)/divider, (self.imaginary * no.real - self.real * no.imaginary)/divider)
+
+    def mod(self):
+        return Complex(math.sqrt(self.real ** 2 + self.imaginary ** 2), 0.00)
+
+    def __str__(self):
+        if self.imaginary == 0:
+            result = "%.2f+0.00i" % (self.real)
+        elif self.real == 0:
+            if self.imaginary >= 0:
+                result = "0.00+%.2fi" % (self.imaginary)
+            else:
+                result = "0.00-%.2fi" % (abs(self.imaginary))
+        elif self.imaginary > 0:
+            result = "%.2f+%.2fi" % (self.real, self.imaginary)
+        else:
+            result = "%.2f-%.2fi" % (self.real, abs(self.imaginary))
+        return result
+
+if __name__ == '__main__':
+    c = map(float, input().split())
+    d = map(float, input().split())
+    x = Complex(*c)
+    y = Complex(*d)
+    print(*map(str, [x+y, x-y, x*y, x/y, x.mod(), y.mod()]), sep='\n')

HackerRank Python Solutions/ClosuresandDecorators/Decorators2NameDirectory.py

@@ -0,0 +1,15 @@
+
+
+import operator
+def person_lister(func):
+    def inner(people):
+        return [func(p) for p in sorted(people, key = lambda x: (int(x[2])))]
+    return inner
+
+@person_lister
+def name_format(person):
+    return ("Mr. " if person[3] == "M" else "Ms. ") + person[0] + " " + person[1]
+
+if __name__ == '__main__':
+    people = [input().split() for i in range(int(input()))]
+    print(*name_format(people), sep='\n')

HackerRank Python Solutions/ClosuresandDecorators/StandardizeMobileNumberUsingDecorators.py

@@ -0,0 +1,12 @@
+
+# Enter your code here. Read input from STDIN. Print output to STDOUT
+n=int(raw_input())
+ar=[]
+for i in range(0,n):
+    tmp_str=raw_input()
+    tmp_str=tmp_str[len(tmp_str)-10:]
+    ar.append(tmp_str)
+
+ar.sort()
+for i in range(0,len(ar)):
+    print "+91 "+ar[i][:5]+" "+ar[i][5:]

HackerRank Python Solutions/Collections/CollectionsOrderedDict.py

@@ -0,0 +1,15 @@
+
+import collections, re
+n = int(input())
+item_od = collections.OrderedDict()
+for i in range(n):
+    record_list = re.split(r'(\d+)$',input().strip())
+    item_name = record_list[0]
+    item_price = int(record_list[1])
+    if item_name not in item_od:
+        item_od[item_name]=item_price
+    else:
+        item_od[item_name]=item_od[item_name]+item_price
+
+for i in item_od:
+    print(i+str(item_od[i]))

HackerRank Python Solutions/Collections/Collectionsdeque.py

@@ -0,0 +1,19 @@
+
+import collections
+n = int(input())
+d = collections.deque()
+for i in range(n):
+    cmd = list(input().strip().split())
+    opt = cmd[0]
+    if opt == 'pop':
+        d.pop()
+    elif opt == 'popleft':
+        d.popleft()
+    elif opt == 'append':
+        d.append(int(cmd[1]))
+    elif opt == 'appendleft':
+        d.appendleft(int(cmd[1]))
+for i in d:
+    print(i,end=' ')
+
+

HackerRank Python Solutions/Collections/Collectionsnamedtuple.py

@@ -0,0 +1,9 @@
+
+n = int(input())
+col_list = list(input().split())
+marks_col = col_list.index("MARKS")
+marks_list = []
+for i in range(n):
+    info_list = list(input().split())
+    marks_list.append(float(info_list[marks_col]))
+print(sum(marks_list)/n)

HackerRank Python Solutions/Collections/DefaultDictTutorial.py

@@ -0,0 +1,10 @@
+
+from collections import defaultdict
+d = defaultdict(list)
+n,m=map(int,input().split())
+for i in range(n):
+    w = input()
+    d[w].append(str(i+1))
+for j in range(m):
+    w = input()
+    print(' '.join(d[w]) or -1)

HackerRank Python Solutions/Collections/MostCommon.py

@@ -0,0 +1,14 @@
+
+import collections
+s = sorted(input().strip())
+s_counter = collections.Counter(s).most_common()
+'''
+s_counter_length = len(s_counter)
+for i in range(0,s_counter_length,1):
+    for j in range(i+1,s_counter_length,1):
+        if (s_counter[i][1] == s_counter[j][1]) and (ord(s_counter[j][0]) < ord(s_counter[i][0])):
+            s_counter[i],s_counter[j] = s_counter[j],s_counter[i]
+'''
+s_counter = sorted(s_counter,key = lambda x: (x[1] * -1,x[0]))
+for i in range(0,3):
+    print(s_counter[i][0],s_counter[i][1])

HackerRank Python Solutions/Collections/PilingUp.py

@@ -0,0 +1,22 @@
+
+from collections import deque
+cas = int(input())
+for t in range(cas):
+    n = int(input())
+    dq = deque(map(int,input().split()))
+    possible = True
+    element = (2**31)+1
+    while dq:
+        left_element = dq[0]
+        right_element = dq[-1]
+        if left_element>=right_element and element>=left_element:
+            element = dq.popleft()
+        elif right_element>=left_element and element>=right_element:
+            element = dq.pop()
+        else:
+            possible = False
+            break
+    if possible:
+        print('Yes')
+    else:
+        print('No')   

HackerRank Python Solutions/Collections/WordOrder.py

@@ -0,0 +1,13 @@
+
+from collections import Counter, OrderedDict
+class OrderedCounter(Counter,OrderedDict):
+    pass
+
+word_ar = []
+n = int(input())
+for i in range(n):
+    word_ar.append(input().strip())
+word_counter = OrderedCounter(word_ar)
+print(len(word_counter))
+for word in word_counter:
+    print(word_counter[word],end=' ')

HackerRank Python Solutions/Collections/collectionsCounter.py

@@ -0,0 +1,11 @@
+
+x = int(input())
+shoe_size = list(map(int,input().split()))
+n = int(input())
+sell = 0
+for i in range(n):
+    s, p = map(int,input().split())
+    if s in shoe_size:
+        sell = sell + p
+        shoe_size.remove(s)
+print(sell)

HackerRank Python Solutions/DateandTime/CalendarModule.py

@@ -0,0 +1,6 @@
+
+import datetime
+import calendar
+m,d,y=map(int,input().split())
+input_date = datetime.date(y,m,d)
+print(calendar.day_name[input_date.weekday()].upper())

HackerRank Python Solutions/DateandTime/TimeDelta.py

@@ -0,0 +1,10 @@
+
+import datetime
+cas = int(input())
+for t in range(cas):
+    timestamp1 = input().strip()
+    timestamp2 = input().strip()
+    time_format = "%a %d %b %Y %H:%M:%S %z"
+    time_second1 = datetime.datetime.strptime(timestamp1,time_format)
+    time_second2 = datetime.datetime.strptime(timestamp2,time_format)
+    print(int(abs((time_second1-time_second2).total_seconds())))

HackerRank Python Solutions/Debugging/DefaultArguments.py

@@ -0,0 +1,5 @@
+
+def print_from_stream(n, stream=EvenStream()):
+    stream.__init__()
+    for _ in range(n):
+        print(stream.get_next())