WEEK 2 Solutions

Author: juhui-jeong

climbing-stairs/juhui-jeong.java

@@ -0,0 +1,17 @@
+class Solution {
+    Map<Integer, Integer> map = new HashMap<>();
+
+    public int climbStairs(int n) {
+        if(n <=2) return n;
+
+        if (map.containsKey(n)) {
+            return map.get(n);
+        }
+
+        int result = climbStairs(n-1) + climbStairs(n-2);
+
+        map.put(n, result);
+
+        return result;
+    }
+}

valid-anagram/juhui-jeong.java

@@ -0,0 +1,9 @@
+class Solution {
+    public boolean isAnagram(String s, String t) {
+        char[] charArrS = s.toCharArray();
+        char[] charArrT = t.toCharArray();        
+        Arrays.sort(charArrS);
+        Arrays.sort(charArrT);
+        return Arrays.equals(charArrS, charArrT);
+    }
+}