[FEhyoeun] WEEK 02 solutions

climbing-stairs/FEhyoeun.ts

@@ -0,0 +1,13 @@
+const cache: number[] = [];
+
+function climbStairs(n: number): number {
+    if(n === 1) return 1
+    if(n === 2) return 2;
+
+    // cache 값 있을 때
+    if(cache[n]) return cache[n]
+
+    // cache 값 없을 때
+    cache[n] = climbStairs(n - 1) + climbStairs(n - 2);
+    return cache[n]
+};

valid-anagram/FEhyoeun.ts

@@ -0,0 +1,22 @@
+function isAnagram(s: string, t: string): boolean {
+    let sObj = {}
+    let tObj = {}
+
+    s.split('').sort().map((sChar) => {
+        if(sChar in sObj) {
+            sObj[sChar] += 1
+        } else {
+            sObj[sChar] = 1
+        }
+    })
+
+    t.split('').sort().map((tChar) => {
+        if(tChar in tObj) {
+            tObj[tChar] += 1
+        } else {
+            tObj[tChar] = 1
+        }
+    })
+
+    return JSON.stringify(sObj) === JSON.stringify(tObj)
+};