[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

data_structures/arrays/sliding_window.py

@@ -4,26 +4,27 @@
 https://www.geeksforgeeks.org/sum-minimum-maximum-elements-subarrays-size-k/
 """
 
-#this function will return sum of min and max of the window
-def get_min_max(array:list ,start:int ,end:int) -> int:
-    
+
+# this function will return sum of min and max of the window
+def get_min_max(array: list, start: int, end: int) -> int:
     max = min = array[start]
-    
-    for i in range(start+1,end+1):
+
+    for i in range(start + 1, end + 1):
         if array[i] < min:
             min = array[i]
         if array[i] > max:
             max = array[i]
-    
-    return max+min
 
-def sum(array:list ,size:int ,k:int) -> int:
+    return max + min
+
+
+def sum(array: list, size: int, k: int) -> int:
     """
     Args:
         array (list): the input array
         size (int): size of the array
         k (int): size of the sub-array
-    
+
     Returns:
         int : sum of the minimum and maximum elements of all sub-arrays of size-k
     """
@@ -33,19 +34,20 @@ def sum(array:list ,size:int ,k:int) -> int:
         18
     """
     # create first window of size k
-    start ,end = 0 ,k-1
+    start, end = 0, k - 1
     result = 0
-    #get the minimum and maximum element from the window and add it to the result
-    result += get_min_max(array,size,start,end)
-    
-    
-    while start < size-k and end < size:
+    # get the minimum and maximum element from the window and add it to the result
+    result += get_min_max(array, size, start, end)
+
+    while start < size - k and end < size:
         start += 1
         end += 1
-        result += get_min_max(array,start,end)
-    
+        result += get_min_max(array, start, end)
+
     return result
 
-if __name__ == '__main__':
+
+if __name__ == "__main__":
     import doctest
-    doctest.testmod()
+
+    doctest.testmod()