diff --git a/climbing-stairs/yoonthecoder.js b/climbing-stairs/yoonthecoder.js
new file mode 100644
index 000000000..587acb4f4
--- /dev/null
+++ b/climbing-stairs/yoonthecoder.js
@@ -0,0 +1,17 @@
+function climbStairs(n) {
+  // if there's only 1 step, return 1
+  if (n === 1) return 1;
+  // initialize the first prev values (when n=1 and n=0 each)
+  let prev1 = 1;
+  let prev2 = 1;
+  // iterate through step 2 to n
+  for (let i = 2; i <= n; i++) {
+    let current = prev1 + prev2;
+    prev2 = prev1;
+    prev1 = current;
+  }
+  return prev1;
+}
+
+// Time complexity: O(n) - single for loop
+// Space Complexity: O(1)
diff --git a/valid-anagram/yoonthecoder.js b/valid-anagram/yoonthecoder.js
new file mode 100644
index 000000000..400312c8c
--- /dev/null
+++ b/valid-anagram/yoonthecoder.js
@@ -0,0 +1,16 @@
+var isAnagram = function (s, t) {
+  const sArray = [];
+  const tArray = [];
+
+  for (i = 0; i < s.length; i++) {
+    sArray.push(s.charAt(i));
+  }
+  for (i = 0; i < t.length; i++) {
+    tArray.push(t.charAt(i));
+  }
+
+  return JSON.stringify(sArray.sort()) === JSON.stringify(tArray.sort());
+};
+
+// Time complexity : O(nlogn)
+// Space complexity : O(n)