Merge pull request #52 from HighnessAtharva/master

Ported from Python2 to Python3 + several fixes

Author: arsho

BasicDataTypes/Lists.py

@@ -8,10 +8,11 @@
 Problem   : https://www.hackerrank.com/challenges/python-lists/problem
 """
 
+
 if __name__ == "__main__":
     N = int(input())
     ar = []
-    for i in range(N):
+    for _ in range(N):
         command_args = input().strip().split(" ")
         cmd = command_args[0]
         if cmd == "print":

BuiltIns/AnyorAll.py

@@ -8,6 +8,7 @@
 Updated   : 29 August 2022
 Problem   : https://www.hackerrank.com/challenges/any-or-all/problem
 """
+
 n = input()
 ar = input().split()
-print(all([int(i) > 0 for i in ar]) and any([i == i[::-1] for i in ar]))
+print(all(int(i) > 0 for i in ar) and any(i == i[::-1] for i in ar))

ClosuresandDecorators/StandardizeMobileNumberUsingDecorators.py

@@ -1,19 +1,21 @@
-'''
+"""
 Title     : Standardize Mobile Number Using Decorators
 Subdomain : Closures and Decorators
 Domain    : Python
 Author    : Ahmedur Rahman Shovon
 Created   : 15 July 2016
 Problem   : https://www.hackerrank.com/challenges/standardize-mobile-number-using-decorators/problem
-'''
+"""
+
+
 # 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:]
+n = int(input())
+ar = []
+for _ in range(n):
+    tmp_str = 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:]
+for item in ar:
+    print(f"+91 {item[:5]} {item[5:]}")

Collections/CollectionsOrderedDict.py

@@ -4,21 +4,22 @@
 Domain    : Python
 Author    : Ahmedur Rahman Shovon
 Created   : 15 July 2016
+Updated   : 08 February 2023
 Problem   : https://www.hackerrank.com/challenges/py-collections-ordereddict/problem
 """
+
 import collections
 import re
 
 n = int(input())
 item_od = collections.OrderedDict()
-for i in range(n):
+for _ 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]))
+    print(f"{i}{item_od[i]}")

Collections/Collectionsdeque.py

@@ -6,20 +6,21 @@
 Created   : 15 July 2016
 Problem   : https://www.hackerrank.com/challenges/py-collections-deque/problem
 """
+
 import collections
 
 n = int(input())
 d = collections.deque()
-for i in range(n):
+for _ in range(n):
     cmd = list(input().strip().split())
     opt = cmd[0]
-    if opt == "pop":
-        d.pop()
-    elif opt == "popleft":
-        d.popleft()
-    elif opt == "append":
+    if opt == "append":
         d.append(int(cmd[1]))
     elif opt == "appendleft":
         d.appendleft(int(cmd[1]))
+    elif opt == "pop":
+        d.pop()
+    elif opt == "popleft":
+        d.popleft()
 for i in d:
     print(i, end=" ")

Collections/Collectionsnamedtuple.py

@@ -6,11 +6,12 @@
 Created   : 15 July 2016
 Problem   : https://www.hackerrank.com/challenges/py-collections-namedtuple/problem
 """
+
 n = int(input())
 col_list = list(input().split())
 marks_col = col_list.index("MARKS")
 marks_list = []
-for i in range(n):
+for _ in range(n):
     info_list = list(input().split())
     marks_list.append(float(info_list[marks_col]))
 print(sum(marks_list) / n)

Collections/DefaultDictTutorial.py

@@ -6,13 +6,14 @@
 Created   : 15 July 2016
 Problem   : https://www.hackerrank.com/challenges/defaultdict-tutorial/problem
 """
+
 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):
+for _ in range(m):
     w = input()
     print(" ".join(d[w]) or -1)

Collections/MostCommon.py

@@ -6,6 +6,7 @@
 Created   : 15 July 2016
 Problem   : https://www.hackerrank.com/challenges/most-commons/problem
 """
+
 import collections
 
 s = sorted(input().strip())
@@ -18,5 +19,5 @@
             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):
+for i in range(3):
     print(s_counter[i][0], s_counter[i][1])

Collections/PilingUp.py

@@ -6,10 +6,11 @@
 Created   : 15 July 2016
 Problem   : https://www.hackerrank.com/challenges/piling-up/problem
 """
+
 from collections import deque
 
 cas = int(input())
-for t in range(cas):
+for _ in range(cas):
     n = int(input())
     dq = deque(map(int, input().split()))
     possible = True

Collections/collectionsCounter.py

@@ -6,11 +6,12 @@
 Created   : 15 July 2016
 Problem   : https://www.hackerrank.com/challenges/collections-counter/problem
 """
+
 x = int(input())
 shoe_size = list(map(int, input().split()))
 n = int(input())
 sell = 0
-for i in range(n):
+for _ in range(n):
     s, p = map(int, input().split())
     if s in shoe_size:
         sell = sell + p