feat(work): add sliding window solution for maximum average subarray and implement longest consecutive sequence

work/1/Easy/Array/643.maximum-average-subarray-i.py

@@ -39,4 +39,15 @@ Constraints:
 
 class Solution:
     def findMaxAverage(self, nums: list[int], k: int) -> float:
-        maxAvg = 0
+        window_sum = 0
+        for i in range(k):
+            window_sum += nums[i]
+        largest = window_sum
+
+        for right in range(k, len(nums)):
+            left = right - k
+            window_sum -= nums[left]
+            window_sum += nums[right]
+            largest = max(largest, window_sum)
+
+        return largest / k