Add more puzzles 🧩

beeankha · beeankha · commit a91020f5da94 · 2023-07-26T20:05:51.000-04:00
diff --git a/Puzzles/PracticeMay2023/09_is_subsequence.py b/Puzzles/PracticeMay2023/09_is_subsequence.py
@@ -0,0 +1,48 @@
+class Solution:
+    def isSubsequence(self, s: str, t: str) -> bool:
+        m = len(s)
+        n = len(t)
+        if m == 0:
+            return True
+        elif n == 0:
+            return False
+        elif m == n:
+            if s == t:
+                return True
+            else:
+                return False
+    
+        index = 0
+        for l in s:
+            new_index = t.find(l)
+            if new_index > 0 and new_index == index:
+                return False
+            elif new_index >= index:
+                index = new_index
+                continue
+            elif index > new_index:
+                new_index = t[slice(index, len(t), 1)].find(l)
+                if new_index < 0:
+                    return False
+                else:
+                    continue
+            else:
+                return False
+        if index:
+            return True
+        else:
+            return False
+        
+
+class BetterSolution:
+    def isSubsequence(self, s: str, t: str) -> bool:
+        if not s:
+            return True
+        
+        s_index = 0
+        for l in t:
+            if l == s[s_index]:
+                s_index += 1
+                if s_index == len(s):
+                    return True
+        return False
diff --git a/Puzzles/PracticeMay2023/10_max_avg_subarray.py b/Puzzles/PracticeMay2023/10_max_avg_subarray.py
@@ -0,0 +1,45 @@
+class Solution:
+    def findMaxAverage(self, nums: List[int], k: int) -> float:
+        if k > len(nums):
+            return 0
+        if k == 0:
+            return 0
+        if not nums:
+            return 0
+        get_max = []
+        index1 = 0
+        index2 = k
+        while index2 <= len(nums):
+            get_max.append(sum(nums[index1:index2]))
+            index1 += 1
+            index2 += 1
+        if get_max:
+            biggest = max(get_max)
+            print(biggest)
+            result = (biggest / k)
+            print(result)
+            return result
+        else:
+            return 0
+
+class BetterSolution:
+    def findMaxAverage(self, nums: List[int], k: int) -> float:
+        if k > len(nums):
+            return 0
+        if k == 0:
+            return 0
+        if not nums:
+            return 0
+        index1 = 0
+        index2 = k
+        biggest = sum(nums[index1:index2])
+        while index2 <= len(nums):
+            if sum(nums[index1:index2]) > biggest:
+                biggest = sum(nums[index1:index2])
+            index1 += 1
+            index2 += 1
+        if biggest:
+            result = (biggest / k)
+            return result
+        else:
+            return 0
diff --git a/Puzzles/PracticeMay2023/11_find_max_altitude.py b/Puzzles/PracticeMay2023/11_find_max_altitude.py
@@ -0,0 +1,7 @@
+class Solution:
+    def largestAltitude(self, gain: List[int]) -> int:
+        starting = [0]
+        for a in gain:
+            starting.append(starting[-1] + a)
+        return max(starting)
+
