jayitsaha · Sep 29, 2020 · Sep 29, 2020
diff --git a/Maths/hcf.js b/Maths/hcf.js
@@ -0,0 +1,29 @@
+//hcf FUNCTION
+let hcf = function(a, b) {
+  a = Math.abs(a)
+  b = Math.abs(b)
+  while (a != b) {
+    if (a > b) a -= b
+    else b -= a
+  }
+  return a
+}
+
+//TAKE INPUT N and append the next N inputs in array
+var n = window.prompt("Enter N: ");
+let arr = [];
+for (let i=0; i<n; i++) {
+    arr[i] = window.prompt('Enter:'+(i+1)+'th element');
+}
+
+
+
+let hcfArr = function(arr) {
+  let hcfres = hcf(arr[0], arr[1])
+  for (let i=3; i<arr.length; i++) {
+    hcfres = hcf(hcfres, arr[i])
+  }
+  return hcfres
+}
+
+console.log(hcfArr(arr));
diff --git a/Strings/anagram_refined.js b/Strings/anagram_refined.js
@@ -0,0 +1,41 @@
+// Two ways implemtation of Anagram
+
+function checkAnagram (a, b) {
+    var y = a.split("").sort().join(""),
+        z = b.split("").sort().join("");
+    console.log(z === y
+        ? a + " and " + b + " are anagrams!"
+        : a + " and " + b + " are not anagrams."
+    );
+}
+
+function isAnagram(str1, str2) {
+
+  if(str1 === str2) {
+    return true;
+  }
+
+  let srt1Length = str1.length;
+  let srt2Length = str2.length;
+
+  if(srt1Length !== srt2Length) {
+    return false;
+  }
+
+  var counts = {};
+
+  for(let i = 0; i < srt1Length; i++) {
+    let index = str1.charCodeAt(i)-97;
+    counts[index] = (counts[index] || 0) + 1;
+  }
+
+  for(let j = 0; j < srt2Length; j++) {
+    let index = str2.charCodeAt(j)-97;
+    if (!counts[index]) {
+      return false;
+    }
+    counts[index]--;
+  }
+
+  return true;
+}