Week 2

Author: 8804who

climbing-stairs/8804who.py

@@ -0,0 +1,9 @@
+class Solution:
+    def climbStairs(self, n: int) -> int:
+        dp = [1] * (n+1)
+
+        for i in range(2, n+1):
+            dp[i] = dp[i-1]+dp[i-2]
+        
+        return dp[n]
+    

product-of-array-except-self/8804who.py

@@ -0,0 +1,17 @@
+class Solution:
+    def productExceptSelf(self, nums: List[int]) -> List[int]:
+        total_product = 1
+
+        for num in nums:
+            if num != 0:
+                total_product *= num
+        
+        if nums.count(0) == 1:
+            return [0 if num != 0 else total_product for num in nums]
+        elif nums.count(0) > 1:
+            return [0 for _ in range(len(nums))]
+        else:
+            return [total_product//num for num in nums]
+    
+
+

valid-anagram/8804who.py

@@ -0,0 +1,5 @@
+from collections import Counter
+class Solution:
+    def isAnagram(self, s: str, t: str) -> bool:
+        return Counter(s) == Counter(t)
+