From b3f46d94c83af21c13d72c9906909691ee58427b Mon Sep 17 00:00:00 2001
From: techieParth <parthdesai997@gmail.com>
Date: Sat, 8 Aug 2020 19:51:36 +0530
Subject: [PATCH 1/3] Add CheckAnagram.js to String Algorithms that checks if
 Strings are anagrams

---
 String/CheckAnagram.js | 52 ++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 52 insertions(+)
 create mode 100644 String/CheckAnagram.js

diff --git a/String/CheckAnagram.js b/String/CheckAnagram.js
new file mode 100644
index 0000000000..92671d0c26
--- /dev/null
+++ b/String/CheckAnagram.js
@@ -0,0 +1,52 @@
+// Anagram check is case sensitive; i.e. Aba and aba is not a anagram.
+// inputs are strings i.e. str1 and str2
+const checkAnagram = (str1,str2) => {
+  // check that inputs are strings.
+  if (typeof str1 !== 'string' || typeof str2 !== 'string') {
+    return 'Not string(s)'
+  }
+  
+  //If both strings have not same lengths then they can not be anagram.
+  if(str1.length !== str2.length){
+	  return 'Not Anagram';
+  }
+	  
+  
+  //Use hashmap to keep count of characters in str1
+  
+  let str1CharCount=new Map();
+  
+  for(let i=0;i<str1.length;i++){
+	  let previousCount=0;
+	  if(str1CharCount.has(str1[i])){
+		previousCount=str1CharCount.get(str1[i]);
+	  }
+	  str1CharCount.set(str1[i],previousCount+1);
+  }
+  
+  //Now check if second string has same characters?
+  
+	for(let i=0;i<str2.length;i++){
+		let previousCount=0;
+		//if str1CharCount has no key for str2[i] then not anagram.
+		if(!str1CharCount.has(str2[i])){
+			return 'Not anagrams';
+		}
+		previousCount=str1CharCount.get(str2[i]);
+		str1CharCount.set(str2[i],previousCount-1);
+	}
+  
+	//Now check if all entries in hashmap has zeros.
+	
+	for(let key in str1CharCount){
+		if(str1CharCount[key]!=0)
+			return 'Not anagrams';
+	}
+  
+	return 'Anagrams'; 
+}
+
+console.log(checkAnagram('abcd','bcad')); //should print anagram
+console.log(checkAnagram('abcd','abef')); //should print not anagram
+console.log(checkAnagram(10,'abcd'));//should print Not String(s).
+console.log(checkAnagram('abs','abds'));//should print not anagram

From e66d3ee365ee2bed54642419ab2f29739eb35264 Mon Sep 17 00:00:00 2001
From: techieParth <parthdesai997@gmail.com>
Date: Sat, 8 Aug 2020 20:01:10 +0530
Subject: [PATCH 2/3] Add CheckAnagram.js to String Algorithms that checks if
 Strings are anagrams

---
 String/CheckAnagram.js | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/String/CheckAnagram.js b/String/CheckAnagram.js
index 92671d0c26..6e768b770f 100644
--- a/String/CheckAnagram.js
+++ b/String/CheckAnagram.js
@@ -39,7 +39,7 @@ const checkAnagram = (str1,str2) => {
 	//Now check if all entries in hashmap has zeros.
 	
 	for(let key in str1CharCount){
-		if(str1CharCount[key]!=0)
+		if(str1CharCount[key]!==0)
 			return 'Not anagrams';
 	}
   

From 86b5a31000bbc12da900ceee31a406a04a9bd2fb Mon Sep 17 00:00:00 2001
From: techieParth <parthdesai997@gmail.com>
Date: Sat, 8 Aug 2020 20:24:33 +0530
Subject: [PATCH 3/3] Add CheckAnagram.js to String Algorithms that checks if
 Strings are anagrams

---
 String/CheckAnagram.js | 82 +++++++++++++++++++++---------------------
 1 file changed, 40 insertions(+), 42 deletions(-)

diff --git a/String/CheckAnagram.js b/String/CheckAnagram.js
index 6e768b770f..1621296923 100644
--- a/String/CheckAnagram.js
+++ b/String/CheckAnagram.js
@@ -1,52 +1,50 @@
 // Anagram check is case sensitive; i.e. Aba and aba is not a anagram.
 // inputs are strings i.e. str1 and str2
-const checkAnagram = (str1,str2) => {
+const checkAnagram = (str1, str2) => {
   // check that inputs are strings.
   if (typeof str1 !== 'string' || typeof str2 !== 'string') {
     return 'Not string(s)'
   }
-  
-  //If both strings have not same lengths then they can not be anagram.
-  if(str1.length !== str2.length){
-	  return 'Not Anagram';
+
+  // If both strings have not same lengths then they can not be anagram.
+  if (str1.length !== str2.length) {
+    return 'Not Anagram'
   }
-	  
-  
-  //Use hashmap to keep count of characters in str1
-  
-  let str1CharCount=new Map();
-  
-  for(let i=0;i<str1.length;i++){
-	  let previousCount=0;
-	  if(str1CharCount.has(str1[i])){
-		previousCount=str1CharCount.get(str1[i]);
-	  }
-	  str1CharCount.set(str1[i],previousCount+1);
+
+  // Use hashmap to keep count of characters in str1
+
+  const str1CharCount = new Map()
+
+  for (let i = 0; i < str1.length; i++) {
+    let previousCount = 0
+    if (str1CharCount.has(str1[i])) {
+      previousCount = str1CharCount.get(str1[i])
+    }
+    str1CharCount.set(str1[i], previousCount + 1)
   }
-  
-  //Now check if second string has same characters?
-  
-	for(let i=0;i<str2.length;i++){
-		let previousCount=0;
-		//if str1CharCount has no key for str2[i] then not anagram.
-		if(!str1CharCount.has(str2[i])){
-			return 'Not anagrams';
-		}
-		previousCount=str1CharCount.get(str2[i]);
-		str1CharCount.set(str2[i],previousCount-1);
-	}
-  
-	//Now check if all entries in hashmap has zeros.
-	
-	for(let key in str1CharCount){
-		if(str1CharCount[key]!==0)
-			return 'Not anagrams';
-	}
-  
-	return 'Anagrams'; 
+
+  // Now check if second string has same characters?
+
+  for (let i = 0; i < str2.length; i++) {
+    let previousCount = 0
+    // if str1CharCount has no key for str2[i] then not anagram.
+    if (!str1CharCount.has(str2[i])) {
+      return 'Not anagrams'
+    }
+    previousCount = str1CharCount.get(str2[i])
+    str1CharCount.set(str2[i], previousCount - 1)
+  }
+
+  // Now check if all entries in hashmap has zeros.
+
+  for (const key in str1CharCount) {
+    if (str1CharCount[key] !== 0) { return 'Not anagrams' }
+  }
+
+  return 'Anagrams'
 }
 
-console.log(checkAnagram('abcd','bcad')); //should print anagram
-console.log(checkAnagram('abcd','abef')); //should print not anagram
-console.log(checkAnagram(10,'abcd'));//should print Not String(s).
-console.log(checkAnagram('abs','abds'));//should print not anagram
+console.log(checkAnagram('abcd', 'bcad')) // should print anagram
+console.log(checkAnagram('abcd', 'abef')) // should print not anagram
+console.log(checkAnagram(10, 'abcd'))// should print Not String(s).
+console.log(checkAnagram('abs', 'abds'))// should print not anagram

<!DOCTYPE html PUBLIC '-//W3C//DTD XHTML 1.0 Transitional//EN' 'http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd'>
<html xmlns='http://www.w3.org/1999/xhtml'>
<head>
<title>pFad - Phonifier reborn</title>
<meta http-equiv='Content-Type' content='text/html; charset=utf-8' />
</head>
<body>
<h1>Pfad - The Proxy pFad of &#169; 2024 Garber Painting. All rights reserved.</h1>


<!-- Disclaimer -->
<p>Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.</p>
<br>
<p>Alternative Proxies:</p><p><a href="http://rainy.clevelandohioweatherforecast.com/php-proxy/index.php?q=https://patch-diff.githubusercontent.com/raw/TheAlgorithms/JavaScript/pull/254.patch" target="_blank">Alternative Proxy</a></p><p><a href="http://rainy.clevelandohioweatherforecast.com/pFad/index.php?u=https://patch-diff.githubusercontent.com/raw/TheAlgorithms/JavaScript/pull/254.patch" target="_blank">pFad Proxy</a></p><p><a href="http://rainy.clevelandohioweatherforecast.com/pFad/v3index.php?u=https://patch-diff.githubusercontent.com/raw/TheAlgorithms/JavaScript/pull/254.patch" target="_blank">pFad v3 Proxy</a></p><p><a href="http://rainy.clevelandohioweatherforecast.com/pFad/v4index.php?u=https://patch-diff.githubusercontent.com/raw/TheAlgorithms/JavaScript/pull/254.patch" target="_blank">pFad v4 Proxy</a></p></body>
</html>