[Yiseull] WEEK 02 solutions

climbing-stairs/Yiseull.py

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

valid-anagram/Yiseull.py

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