Reformat all code

Author: vchan14

Absolute Value Sort/absSort.py

@@ -1,28 +1,28 @@
 def absSort(arr):
-  abs_array = []
-  
-  for i in range(len(arr)):
-    if arr[i] < 0: 
-      abs_array.append([arr[i] * -1, -1])
-    elif arr[i] > 0:
-      abs_array.append([arr[i], 1])
-    else:
-      abs_array.append([0, 1])
-  
-  min_index = 0
-  for i in range(len(abs_array)):
-    min_index = i 
-    for j in range(i+1, len(abs_array)):
-      if abs_array[min_index][0] > abs_array[j][0]:
-        min_index = j
-      elif abs_array[min_index][0] == abs_array[j][0]:
-        if abs_array[min_index][1] > abs_array[j][1]:
-          min_index = j 
-    abs_array[min_index], abs_array[i] = abs_array[i], abs_array[min_index]
-    
-    #print("Swap {} with {}". format(abs_array[min_index], abs_array[j]))
-  
-  result = []
-  for i in range(len(abs_array)):
-    result.append(abs_array[i][0] * abs_array[i][1])
-  return result
+    abs_array = []
+
+    for i in range(len(arr)):
+        if arr[i] < 0:
+            abs_array.append([arr[i] * -1, -1])
+        elif arr[i] > 0:
+            abs_array.append([arr[i], 1])
+        else:
+            abs_array.append([0, 1])
+
+    min_index = 0
+    for i in range(len(abs_array)):
+        min_index = i
+        for j in range(i + 1, len(abs_array)):
+            if abs_array[min_index][0] > abs_array[j][0]:
+                min_index = j
+            elif abs_array[min_index][0] == abs_array[j][0]:
+                if abs_array[min_index][1] > abs_array[j][1]:
+                    min_index = j
+        abs_array[min_index], abs_array[i] = abs_array[i], abs_array[min_index]
+
+        # print("Swap {} with {}". format(abs_array[min_index], abs_array[j]))
+
+    result = []
+    for i in range(len(abs_array)):
+        result.append(abs_array[i][0] * abs_array[i][1])
+    return result

Absolute Value Sort/test.py

@@ -4,56 +4,55 @@
 
 class test_absSort(unittest.TestCase):
     def testcase_1(self):
-        myInput =  [2,-7,-2,-2,0]
-        expected = [0,-2,-2,2,-7]
+        myInput = [2, -7, -2, -2, 0]
+        expected = [0, -2, -2, 2, -7]
         self.assertEqual(absSort(myInput), expected)
 
     def testcase_2(self):
-        myInput =  [-2,1]
-        expected = [1,-2]
+        myInput = [-2, 1]
+        expected = [1, -2]
         self.assertEqual(absSort(myInput), expected)
-    
+
     def testcase_3(self):
-        myInput = [0,1,2]
-        expected =[0,1,2]
+        myInput = [0, 1, 2]
+        expected = [0, 1, 2]
         self.assertEqual(absSort(myInput), expected)
-    
+
     def testcase_4(self):
-        myInput =  [2,-1,-1,-1]
-        expected =[-1,-1,-1,2]
+        myInput = [2, -1, -1, -1]
+        expected = [-1, -1, -1, 2]
         self.assertEqual(absSort(myInput), expected)
-    
+
     def testcase_5(self):
-        myInput = [-2,3,5,-1,4]
-        expected = [-1,-2,3,4,5]
+        myInput = [-2, 3, 5, -1, 4]
+        expected = [-1, -2, 3, 4, 5]
         self.assertEqual(absSort(myInput), expected)
-    
+
     def testcase_6(self):
-        myInput =  [4,-1,6,-4,2,-1]
-        expected = [-1,-1,2,-4,4,6]
+        myInput = [4, -1, 6, -4, 2, -1]
+        expected = [-1, -1, 2, -4, 4, 6]
         self.assertEqual(absSort(myInput), expected)
-    
+
     def testcase_7(self):
-        myInput = [6,4,-5,0,-1,7,0]
-        expected =[0,0,-1,4,-5,6,7]
+        myInput = [6, 4, -5, 0, -1, 7, 0]
+        expected = [0, 0, -1, 4, -5, 6, 7]
         self.assertEqual(absSort(myInput), expected)
-    
+
     def testcase_8(self):
-        myInput =  [-7,-2,-2,6,5,-6,-2,-6]
-        expected = [-2,-2,-2,5,-6,-6,6,-7]
+        myInput = [-7, -2, -2, 6, 5, -6, -2, -6]
+        expected = [-2, -2, -2, 5, -6, -6, 6, -7]
 
         self.assertEqual(absSort(myInput), expected)
-    
+
     def testcase_9(self):
-        myInput =[-4,9,-1,1,-1,2,-8,-6,3]
-        expected = [-1,-1,1,2,3,-4,-6,-8,9]
+        myInput = [-4, 9, -1, 1, -1, 2, -8, -6, 3]
+        expected = [-1, -1, 1, 2, 3, -4, -6, -8, 9]
         self.assertEqual(absSort(myInput), expected)
 
 
-
-
 def main():
     unittest.main()
 
+
 if __name__ == "__main__":
     main()

Array Index & Element Equality/index_equals_value_search.py

@@ -1,23 +1,21 @@
 def index_equals_value_search(arr):
-  size = len(arr)
-  result = -1
-  result = helper(0, size-1, arr)  
-  return result 
-  
-  
+    size = len(arr)
+    result = -1
+    result = helper(0, size - 1, arr)
+    return result
+
+
 def helper(lower, upper, arr):
-  mid = (upper + lower)// 2
-  val = arr[mid]
-  
-  if(lower > upper):
-    return -1 
-  if(val > mid): 
-    return helper(lower, mid-1, arr)
-  
-  elif(val < mid):
-    return helper(mid+1, upper, arr)
-  
-  else:
-    return val 
-    
-    
+    mid = (upper + lower) // 2
+    val = arr[mid]
+
+    if lower > upper:
+        return -1
+    if val > mid:
+        return helper(lower, mid - 1, arr)
+
+    elif val < mid:
+        return helper(mid + 1, upper, arr)
+
+    else:
+        return val

Array Index & Element Equality/test.py

@@ -4,42 +4,39 @@
 
 class test_flatten_a_dicionary(unittest.TestCase):
     def testcase_1(self):
-        myInput =  [0]
+        myInput = [0]
         expected = 0
         self.assertEqual(index_equals_value_search(myInput), expected)
 
-
     def testcase_2(self):
-        myInput =  [0,3]
+        myInput = [0, 3]
         expected = 0
         self.assertEqual(index_equals_value_search(myInput), expected)
-      
+
     def testcase_3(self):
-        myInput = [-8,0,1,3,5]
-        expected =  3
+        myInput = [-8, 0, 1, 3, 5]
+        expected = 3
         self.assertEqual(index_equals_value_search(myInput), expected)
 
-
     def testcase_4(self):
-        myInput =  [-5,0,2,3,10,29]
-        expected =  2
+        myInput = [-5, 0, 2, 3, 10, 29]
+        expected = 2
         self.assertEqual(index_equals_value_search(myInput), expected)
 
     def testcase_5(self):
-        myInput =  [-5,0,3,4,10,18,27]
+        myInput = [-5, 0, 3, 4, 10, 18, 27]
         expected = -1
         self.assertEqual(index_equals_value_search(myInput), expected)
 
     def testcase_6(self):
-        myInput = [-6,-5,-4,-1,1,3,5,7]
+        myInput = [-6, -5, -4, -1, 1, 3, 5, 7]
         expected = 7
         self.assertEqual(index_equals_value_search(myInput), expected)
 
 
-
-
 def main():
     unittest.main()
 
+
 if __name__ == "__main__":
     main()

Array Quadruplet/find_array_quadruplet.py

@@ -1,32 +1,27 @@
-
 import collections
+
+
 def find_array_quadruplet(arr, s):
-  arr.sort()
-  myTable = {}
-  for i in arr: 
-    if i in myTable:
-      myTable[i] +=1
-    else:
-      myTable[i] = 1
-  
-  for i in range(len(arr)-2):
-    for j in range(i+1, len(arr)-1):
-      for k in range(j+1, len(arr)): 
-        myTable[arr[i]] -= 1
-        myTable[arr[j]] -= 1
-        myTable[arr[k]] -= 1
-        mySum = s - (arr[i] + arr[j] + arr[k])
-        if mySum in myTable and myTable[mySum] > 0:
-          return [arr[i], arr[j], arr[k], mySum]
-        
-        myTable[arr[i]] += 1
-        myTable[arr[j]] += 1
-        myTable[arr[k]] += 1
-  
-  return []
-        
-  
+    arr.sort()
+    myTable = {}
+    for i in arr:
+        if i in myTable:
+            myTable[i] += 1
+        else:
+            myTable[i] = 1
+
+    for i in range(len(arr) - 2):
+        for j in range(i + 1, len(arr) - 1):
+            for k in range(j + 1, len(arr)):
+                myTable[arr[i]] -= 1
+                myTable[arr[j]] -= 1
+                myTable[arr[k]] -= 1
+                mySum = s - (arr[i] + arr[j] + arr[k])
+                if mySum in myTable and myTable[mySum] > 0:
+                    return [arr[i], arr[j], arr[k], mySum]
 
-      
-      
+                myTable[arr[i]] += 1
+                myTable[arr[j]] += 1
+                myTable[arr[k]] += 1
 
+    return []

Array Quadruplet/test.py

@@ -4,53 +4,51 @@
 
 class test_absSort(unittest.TestCase):
     def testcase_1(self):
-        myInput =  []
+        myInput = []
         s = 12
         expected = []
-        self.assertEqual(find_array_quadruplet(myInput,s), expected)
+        self.assertEqual(find_array_quadruplet(myInput, s), expected)
 
     def testcase_2(self):
-        myInput =  [4,4,4]
-        s = 12 
+        myInput = [4, 4, 4]
+        s = 12
         expected = []
-        self.assertEqual(find_array_quadruplet(myInput,s), expected)
-    
+        self.assertEqual(find_array_quadruplet(myInput, s), expected)
+
     def testcase_3(self):
-        myInput = [4,4,4,2]
+        myInput = [4, 4, 4, 2]
         s = 16
-        expected =[]
-        self.assertEqual(find_array_quadruplet(myInput,s), expected)
-    
+        expected = []
+        self.assertEqual(find_array_quadruplet(myInput, s), expected)
+
     def testcase_4(self):
-        myInput =  [4,4,4,4]
+        myInput = [4, 4, 4, 4]
         s = 16
-        expected =[4,4,4,4]
-        self.assertEqual(find_array_quadruplet(myInput,s), expected)
-    
+        expected = [4, 4, 4, 4]
+        self.assertEqual(find_array_quadruplet(myInput, s), expected)
+
     def testcase_5(self):
-        myInput = [2,7,4,0,9,5,1,3]
+        myInput = [2, 7, 4, 0, 9, 5, 1, 3]
         s = 20
-        expected = [0,4,7,9]
-        self.assertEqual(find_array_quadruplet(myInput,s), expected)
-    
+        expected = [0, 4, 7, 9]
+        self.assertEqual(find_array_quadruplet(myInput, s), expected)
+
     def testcase_6(self):
-        myInput =  [2,7,4,0,9,5,1,3]
+        myInput = [2, 7, 4, 0, 9, 5, 1, 3]
         s = 120
         expected = []
-        self.assertEqual(find_array_quadruplet(myInput,s), expected)
-    
+        self.assertEqual(find_array_quadruplet(myInput, s), expected)
+
     def testcase_7(self):
-        myInput = [1,2,3,4,5,9,19,12,12,19]
+        myInput = [1, 2, 3, 4, 5, 9, 19, 12, 12, 19]
         s = 40
-        expected =[4,5,12,19]
+        expected = [4, 5, 12, 19]
         self.assertEqual(find_array_quadruplet(myInput, s), expected)
-    
-   
-    
- 
+
 
 def main():
     unittest.main()
 
+
 if __name__ == "__main__":
     main()