[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/fruit_into_baskets.py

@@ -13,6 +13,7 @@
 from typing import List
 from collections import defaultdict
 
+
 class FruitIntoBaskets:
     def total_fruit(self, fruits: List[int]) -> int:
         count = defaultdict(int)  # Stores count of each fruit type
@@ -33,8 +34,9 @@ def total_fruit(self, fruits: List[int]) -> int:
 
         return max_fruit
 
+
 # Example dry run
 if __name__ == "__main__":
-    fruits = [1,2,1,2,3]
+    fruits = [1, 2, 1, 2, 3]
     solver = FruitIntoBaskets()
     print("Maximum Fruits Collected:", solver.total_fruit(fruits))

data_structures/arrays/longest_ones_after_replacement.py

@@ -11,6 +11,7 @@
 
 from typing import List
 
+
 class LongestOnesAfterReplacement:
     def longest_ones(self, nums: List[int], k: int) -> int:
         left = 0  # Left pointer of sliding window
@@ -31,9 +32,10 @@ def longest_ones(self, nums: List[int], k: int) -> int:
 
         return max_len
 
+
 # Example dry run
 if __name__ == "__main__":
-    nums = [1,0,1,1,0,1]
+    nums = [1, 0, 1, 1, 0, 1]
     k = 1
     solver = LongestOnesAfterReplacement()
     print("Longest Ones After Replacement:", solver.longest_ones(nums, k))

data_structures/arrays/sliding_window_maximum.py

@@ -18,6 +18,7 @@
 from collections import deque
 from typing import List
 
+
 class SlidingWindowMaximum:
     def max_sliding_window(self, nums: List[int], k: int) -> List[int]:
         if not nums:
@@ -43,9 +44,10 @@ def max_sliding_window(self, nums: List[int], k: int) -> List[int]:
 
         return result
 
+
 # Example dry run
 if __name__ == "__main__":
-    nums = [1,3,-1,-3,5,3,6,7]
+    nums = [1, 3, -1, -3, 5, 3, 6, 7]
     k = 3
     solver = SlidingWindowMaximum()
     print("Sliding Window Maximum:", solver.max_sliding_window(nums, k))