diff --git a/climbing-stairs/Zioq.js b/climbing-stairs/Zioq.js
new file mode 100644
index 000000000..e199bb1b7
--- /dev/null
+++ b/climbing-stairs/Zioq.js
@@ -0,0 +1,30 @@
+/**
+ * @param {number} n
+ * @return {number}
+ */
+var climbStairs = function(n) {
+    // 1 -> 1
+    // 2 -> (1+1) | 2
+    // 3 -> (1+1+1) | (1+2) | (2+1)
+    // 4 -> (1+1+1+1) | (2+1+1) | (1+2+1) | (1+1+2) | (1+2+2)
+    // 5 -> (1+1+1+1+1) | (2+1+1+1) | (1+2+1+1) | (1+1+2+1) | (1+1+1+2) | (1+2+2) | (2+1+2) | (2+2+1)
+    if(n <=3) return n
+
+    let a = 0;
+    let b = 1;
+    let c = 0;
+
+    for(let i=0; i<n; i++) {
+        c = a+b;
+        a = b;
+        b = c;
+    }
+    return b;
+};
+
+
+console.log(climbStairs(2))
+console.log(climbStairs(3))
+console.log(climbStairs(4))
+console.log(climbStairs(5))
+
diff --git a/valid-anagram/Zioq.js b/valid-anagram/Zioq.js
new file mode 100644
index 000000000..a1aa75989
--- /dev/null
+++ b/valid-anagram/Zioq.js
@@ -0,0 +1,42 @@
+/**
+ * @param {string} s
+ * @param {string} t
+ * @return {boolean}
+ */
+var isAnagram = function(s, t) {
+    if( s.length !== t.length ) {return false} 
+
+    // Change string to arr
+    // let s_arr = s.split('');
+    // let t_arr = t.split('');
+    /* WHAT IF SORT IS NOT ALLOWED */
+    // let s_arr_sort = s_arr.sort();
+    // let t_arr_sort = t_arr.sort();
+    // return JSON.stringify(s_arr_sort) === JSON.stringify(t_arr_sort); // Comparison array
+
+
+    // Use map to count characters in the s
+    // And remove character with t from map
+
+    const map = new Map();
+
+    for (let c of s) {
+        map[c] = (map[c] || 0) + 1;
+    }
+
+    for (let c of t) {
+        if (!map[c]) return false;
+        map[c]--;
+    }
+
+    return true;    
+};
+/* 
+    Time Complexity: O(n)
+    Space Complexity: O(n)
+*/
+
+
+console.log(isAnagram("anagram","nagaram"));
+console.log(isAnagram("rat","car"));
+