fix syntax error and remove .idea

Binary_Search/Binary_Search_Practice_October_8.py

@@ -46,7 +46,7 @@ def binary_search(nums, target):
         mid = (left + right) // 2
         if nums[mid] == target:
             return mid
-        elif nums[mid] < target
+        elif nums[mid] < target:
             left = mid + 1
         else:
             right = mid - 1

Return_Sum_Min_Pair_From_Array/Return_Sum_Min_Pair_From_Array_September_30.py

@@ -1,51 +1,18 @@
 import sys
 
-# def smallest_pair(nums):
-#     min = sys.maxsize
-#     secondMin = sys.maxsize
-#     for j in range(len(nums)):
-#         if nums[j] < min:
-#             secondMin = min
-#             min = nums[j]
-#         elif (nums[j] < secondMin) and (nums[j] != min):
-#             secondMin = nums[j]
-#     return secondMin + min
 
 def smallest_pair(nums):
-    min = float('inf')
-    secondMin = float('inf')
-    for j in range(len(nums)):
-        if nums[j] < min:
-            secondMin = min
-            min = nums[j]
-        elif (nums[j] < secondMin) and (nums[j] != min):
-            secondMin = nums[j]
-    return secondMin + min
+    min_number = nums[0]
+    second_min = nums[1]
+    for ind, i in enumerate(nums[2:]):
+        if i < min_number:
+            second_min = min_number
+            min_number = i
+        elif (i < second_min) and (i != min_number):
+            second_min = nums[j]
+    return second_min + min_number
 
 
-def smallest_pair(nums):
-    min = float('inf')
-    secondMin = float('inf')
-    for j in range(len(nums)):
-        if nums[j] < min:
-            secondMin = min
-            min = nums[j]
-        elif (nums[j] < secondMin) and (nums[j] != min):
-            secondMin = nums[j]
-    return secondMin + min
-
-
-def smallest_pair(nums):
-    min = float('inf')
-    secondMin = float('inf')
-    for j in range(len(nums)):
-        if nums[j] < min:
-            secondMin = min
-            min = nums[j]
-        elif (nums[j] < secondMin) and (nums[j] != min):
-            secondMin = nums[j]
-    return secondMin + min
-
 if __name__ == "__main__":
-    nums = [1,2,3,4,5]
-    print(smallest_pair(nums))
+    nums = [1, 2, 3, 4, 5]
+    print(smallest_pair(nums))