Fix linting for HackerRank solutions

Author: Alperencode

HackerRank/Almost-Sorted-u.py

@@ -2,54 +2,57 @@
 # https://www.hackerrank.com/challenges/almost-sorted/problem
 
 class Reverse:
- def __init__(self,arr):
+ def __init__(self, arr):
  self.arr = arr
- self.l,self.r = 0,0
- 
+ self.left, self.right = 0, 0
+
  def canReverse(self):
  reverse = []
- for index,item in enumerate(self.arr): 
+ for index, item in enumerate(self.arr):
  if index != len(self.arr) - 1:
  if item > self.arr[index+1]:
- self.l = index
+ self.left = index
  arr2 = self.arr[index:]
- for index2,item2 in enumerate(arr2):
- if index2 != len(arr2)-1: 
+ for index2, item2 in enumerate(arr2):
+ if index2 != len(arr2)-1:
  if item2 > arr2[index2+1]:
- reverse.append(item2) 
+ reverse.append(item2)
  else:
  reverse.append(item2)
- self.r = index2
+ self.right = index2
  break
  else:
  reverse.append(item2)
- self.r = index2
- break 
+ self.right = index2
+ break
  break
  else:
  return False
- 
- self.arr[self.l,self.r] = reversed(self.arr[self.l,self.r])
- return self.arr == sorted(self.arr) 
+
+ self.arr[self.left:self.right + 1] = reversed(
+ self.arr[self.left:self.right + 1]
+ )
+ return self.arr == sorted(self.arr)
+
 
 class Swap:
- def __init__(self,arr):
+ def __init__(self, arr):
  self.arr = arr
- self.l,self.r = 0,0
- 
+ self.l, self.r = 0, 0
+
  def canSwap(self):
- for index,item in enumerate(self.arr):
- if index != len(self.arr) -1:
+ for index, item in enumerate(self.arr):
+ if index != len(self.arr) - 1:
  if item > self.arr[index+1]:
  # Gave up here :D
- pass 
+ pass
  else:
  return False
- 
+
 
 def almostSorted(arr):
  if arr == sorted(arr):
  print("yes")
  else:
  # Checks
- pass
+ pass

HackerRank/Bill-Division.py

@@ -2,7 +2,7 @@
 # https://www.hackerrank.com/challenges/bon-appetit/problem
 
 def bonAppetit(bill, k, b):
- if b==sum(bill)/2:
+ if b == sum(bill)/2:
  bill.pop(k)
  print(f"{b-sum(bill)//2}")
  else:
@@ -12,4 +12,4 @@ def bonAppetit(bill, k, b):
 # bonAppetit([3, 10, 2, 9], 1, 12) - 5
 # bonAppetit([3, 10, 2, 9], 1, 7) - Bon Appetit
 
-# Status - Accepted
+# Status - Accepted

HackerRank/Breaking-the-Records.py

@@ -2,8 +2,8 @@
 # https://www.hackerrank.com/challenges/breaking-best-and-worst-records/problem
 
 def breakingRecords(scores):
- min_,max_ = scores[0],scores[0]
- ans = [0,0]
+ min_, max_ = scores[0], scores[0]
+ ans = [0, 0]
  for item in scores:
  if item > max_:
  ans[0] += 1
@@ -17,4 +17,4 @@ def breakingRecords(scores):
 # breakingRecords([10,5,20,20,4,5,2,25,1]) - [2,4]
 # breakingRecords([3,4,21,36,10,28,35,5,24,42]) - [4,0]
 
-# Status - Success
+# Status - Success

HackerRank/Caesar-Cipher-1.py

@@ -6,14 +6,14 @@ def caesarCipher(s, k):
  ans = ""
  for char in s:
  if char.upper() in alphabet:
- rotated = alphabet[(alphabet.index(char.upper())+k)%26]
- ans += rotated if char.isupper() else rotated.lower() 
- else: 
+ rotated = alphabet[(alphabet.index(char.upper())+k) % 26]
+ ans += rotated if char.isupper() else rotated.lower()
+ else:
  ans += char
  return ans
 
 # Testcases
 # "middle-Outz" 2 -> "okffng-Qwvb"
 # "Always-Look-on-the-Bright-Side-of-Life" 5 -> "Fqbfdx-Qttp-ts-ymj-Gwnlmy-Xnij-tk-Qnkj"
 
-# Status - Accepted
+# Status - Accepted

HackerRank/Compare-Triplets.py

@@ -2,18 +2,18 @@
 # https://www.hackerrank.com/challenges/compare-the-triplets/
 
 def compareTriplets(a, b):
- ans1,ans2 = 0,0
- for i in range(0,3):
+ ans1, ans2 = 0, 0
+ for i in range(0, 3):
  if a[i] > b[i]:
  ans1 += 1
  elif a[i] == b[i]:
  continue
  else:
  ans2 += 1
- return [ans1,ans2]
+ return [ans1, ans2]
 
 # Testcases
 # a = [5,6,7] - b = [3,6,10] - [1,1]
 # a = [17,28,30] - b = [99,16,8] - [2,1]
 
-# Status - Passed
+# Status - Passed

HackerRank/Counting-Sort-1.py

@@ -11,4 +11,4 @@ def countingSort(arr):
 # Input: 63 25 73 1 98 73 56 84 86 57 16 83 8 25 81 56 9 53 98 67 99 12 83 89 80 91 39 86 76 85 74 39 25 90 59 10 94 32 44 3 89 30 27 79 46 96 27 32 18 21 92 69 81 40 40 34 68 78 24 87 42 69 23 41 78 22 6 90 99 89 50 30 20 1 43 3 70 95 33 46 44 9 69 48 33 60 65 16 82 67 61 32 21 79 75 75 13 87 70 33
 # Expected: 0 2 0 2 0 0 1 0 1 2 1 0 1 1 0 0 2 0 1 0 1 2 1 1 1 3 0 2 0 0 2 0 3 3 1 0 0 0 0 2 2 1 1 1 2 0 2 0 1 0 1 0 0 1 0 0 2 1 0 1 1 1 0 1 0 1 0 2 1 3 2 0 0 2 1 2 1 0 2 2 1 2 1 2 1 1 2 2 0 3 2 1 1 0 1 1 1 0 2 2
 
-# Status: Accepted
+# Status: Accepted

HackerRank/Diagonel-Difference.py

@@ -2,7 +2,7 @@
 # https://www.hackerrank.com/challenges/diagonal-difference/problem
 
 def diagonalDifference(arr):
- diag1,diag2 = 0,0
+ diag1, diag2 = 0, 0
  for i in range(len(arr)):
  diag1 += arr[i][i]
  diag2 += arr[i][len(arr)-1-i]
@@ -17,7 +17,7 @@ def diagonalDifference(arr):
 # Status - Passed
 
 
-##Note: one of the testcase matrix was this (Answer: 462):
+# Note: one of the testcase matrix was this (Answer: 462):
 
 # 15 49 -77 31 15 -17 -96 80 79 -11 -33 -95 -40 85 1 -84 -89 -66 81 38 26 -65 -15 -19 -29 -69 80 51 79 -42
 # -93 -96 22 41 -38 -36 94 96 -47 -83 -61 13 47 -25 -71 74 93 5 3 23 47 -19 6 -53 41 -48 -34 39 -55 -100
@@ -48,4 +48,4 @@ def diagonalDifference(arr):
 # -56 24 91 80 -56 -78 60 0 -38 -93 -65 -91 -33 -7 49 1 56 30 -43 32 -63 -57 35 50 74 -86 -66 -19 34 36
 # 55 -46 -25 -27 99 71 38 -98 72 -81 68 66 84 -14 17 -86 76 -36 88 -54 29 33 -98 -94 -44 79 16 -16 7 53
 # -53 -34 -39 -93 -42 -79 95 24 66 -94 -8 -38 -37 45 -9 26 86 75 -59 -2 -80 -61 -68 -66 -59 -41 -18 8 26 -24
-# 72 23 -31 -8 70 38 98 95 97 57 -90 -88 -89 -26 -62 89 67 22 -94 48 33 20 -7 -87 -94 33 -81 80 -64 87
+# 72 23 -31 -8 70 38 98 95 97 57 -90 -88 -89 -26 -62 89 67 22 -94 48 33 20 -7 -87 -94 33 -81 80 -64 87

HackerRank/Flipping-the-Matrix.py

@@ -6,9 +6,9 @@ def flippingMatrix(matrix):
  ans = 0
  for i in range(n):
  for j in range(n):
- ans += max(matrix[i][j],matrix[i][2*n-1-j],matrix[2*n-1-i][j],matrix[2*n-1-i][2*n-1-j])
+ ans += max(matrix[i][j], matrix[i][2*n-1-j], matrix[2*n-1-i][j], matrix[2*n-1-i][2*n-1-j])
  return ans
 
-##Note: I'll document this solution
+# Note: I'll document this solution
 
-# Status: Accepted
+# Status: Accepted

HackerRank/Grading-Students.py

@@ -2,12 +2,12 @@
 # https://www.hackerrank.com/challenges/grading/problem
 
 def gradingStudents(grades):
- for index,grade in enumerate(grades):
- if grade%5 >= 3 and grade >= 38:
- grades[index] += 5-grade%5
+ for index, grade in enumerate(grades):
+ if grade % 5 >= 3 and grade >= 38:
+ grades[index] += 5-grade % 5
  return grades
 
 # Testcases
 # 73 67 38 33 - 75 67 40 33
 
-# Status - Passed 
+# Status - Passed

HackerRank/Lonely-Integer.py

@@ -3,13 +3,13 @@
 
 def lonelyinteger(a):
  for i in a:
- if a.count(i) == 1: 
- return i 
+ if a.count(i) == 1:
+ return i
  break
 
 # Testcases
-# 0 0 1 2 1 - 2 
+# 0 0 1 2 1 - 2
 # 1 1 2 - 2
 # 1 2 3 4 3 2 1 - 4
 
-# Status - Passed
+# Status - Passed