feat: Solved 12 Python domain problems

Author: ralvarezdev

.idea/.gitignore

@@ -0,0 +1,17 @@
+# Enter your code here. Read input from STDIN. Print output to STDOUT4
+from collections import defaultdict
+
+groupASize, groupBSize = list(map(int, input().split()))
+
+groupA = defaultdict(list)
+for i in range(1, groupASize + 1):
+    groupA[input()].append(i)
+
+groupB = list()
+for _ in range(0, groupBSize):
+    groupB.append(input())
+
+for element in groupB:
+    results = groupA[element]
+
+    print(-1 if len(results) == 0 else " ".join(map(str, results)))

.idea/hackerrank.iml

@@ -0,0 +1,18 @@
+# Enter your code here. Read input from STDIN. Print output to STDOUT
+from collections import Counter
+
+profit = 0
+
+nShoes = int(input())
+shoesSizes = Counter(input().split(' '))
+nClients = int(input())
+
+for i in range(0, nClients):
+    shoesSize, price = input().split(' ')
+    amount = shoesSizes[shoesSize]
+
+    if amount > 0:
+        profit += int(price)
+        shoesSizes.update({shoesSize: -1})
+
+print(profit)

.idea/inspectionProfiles/profiles_settings.xml

@@ -0,0 +1,22 @@
+# Enter your code here. Read input from STDIN. Print output to STDOUT
+from collections import deque
+
+nCmds = int(input())
+deque = deque()
+
+for i in range(0, nCmds):
+    cmd = input().split()
+
+    if cmd[0] == "append":
+        deque.append(int(cmd[1]))
+
+    elif cmd[0] == "appendleft":
+        deque.appendleft(int(cmd[1]))
+
+    elif cmd[0] == "pop":
+        deque.pop()
+
+    elif cmd[0] == "popleft":
+        deque.popleft()
+
+print(" ".join([str(d) for d in deque]))

.idea/misc.xml

@@ -0,0 +1,16 @@
+# Enter your code here. Read input from STDIN. Print output to STDOUT
+from collections import namedtuple
+from functools import reduce
+
+nStudents = int(input())
+colsName = input().split()
+Student = namedtuple('Student', ','.join(colsName))
+students = []
+
+for i in range(0, nStudents):
+    students.append(Student(*input().split()))
+
+marks = list(map(int, [s.MARKS for s in students]))
+results = reduce(lambda a, b: a + b, marks) / len(students)
+
+print(results)