adding algo

Author: ivanpenaloza

src/my_project/interviews/amazon_high_frequency_23/round_2/kids_with_the_greates_number_of_candies.py

@@ -0,0 +1,8 @@
+from typing import List, Union, Collection, Mapping, Optional
+from abc import ABC, abstractmethod
+
+class Solution:
+    def kidsWithCandies(self, candies: List[int], extraCandies: int) -> List[bool]:
+        max_candies = max(candies)
+        return [candy + extraCandies >= max_candies for candy in candies]
+        

src/my_project/interviews/amazon_high_frequency_23/round_2/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