adding updates

src/my_project/interviews/amazon_high_frequency_23/round_7/maximum_sum_distinct_subarrays_lenght_k.py

@@ -0,0 +1,25 @@
+from typing import List, Union, Collection, Mapping, Optional
+
+class Solution:
+    def maximumSubarraySum(self, nums: List[int], k: int) -> int:
+        max_sum = 0
+        current_sum = 0
+        freq = {}
+        left = 0
+
+        for right in range(len(nums)):
+            current_sum += nums[right]
+
+            freq[nums[right]] = freq.get(nums[right], 0) + 1
+
+            if right - left > k - 1:
+                freq[nums[left]] -= 1
+                if freq[nums[left]] == 0:
+                    del freq[nums[left]]
+                current_sum -= nums[left]
+                left += 1
+
+            if right - left == k - 1 and len(freq) == k: 
+                max_sum = max(max_sum, current_sum)
+
+        return max_sum

src/my_project/interviews/google_top_exercises/round_1/28_alien_dictionary.py

@@ -57,15 +57,20 @@ def alienOrder_DFS(self, words: List[str]) -> str:
         adj = defaultdict(set)
         letters = {c for word in words for c in word}
 
+        print(list(zip(words, words[1:])))
         for first, second in zip(words, words[1:]):
             for c1, c2 in zip(first, second):
+                print(list(zip(first,second)))
+                print(c1,c2)
                 if c1 != c2:
                     adj[c1].add(c2)
                     break
             else:
                 if len(second) < len(first):
                     return ""
 
+        print(adj)
+
         visiting = {}
         order = []
 
@@ -88,3 +93,7 @@ def dfs(c: str) -> bool:
                 return ""
 
         return "".join(reversed(order))
+
+
+solution = Solution()
+print(solution.alienOrder_DFS(words = ["wrt","wrf","er","ett","rftt"]))