Merge pull request ashutosh97#77 from benlop27/master

Added Cenit Polar Crypto

Author: ashutosh97

Cenit-Polar-Crypt/Issue.txt

@@ -0,0 +1,40 @@
+Create a solution that can be able to encrypt a string using Cenit-Polar Method
+
+- Solution
+Cenit Polar it's a basic scout crytographic method based on replace characters
+corresponding this order :
+-------------------------
+| C | E  | N  | I  | T  | 
+-------------------------
+| P | O  | L  | A  | R  | 
+-------------------------
+
+The main idea is take a word and replace the characters which match in CENIT, with its equivalent on POLAR and viceversa.
+
+For example, if you want to encrypt the word COMPUTER, you should have to replace any character.
+If some character don't have match, you should keep it in place:
+
+C = P
+O = E
+M = M
+P = C
+U = U
+T = R
+E = O
+R = T
+
+If you want to decript the word generated, you have to do reverse the process, replacing any character which have match in POLAR,
+with its equivalent on CENIT :
+
+P = C 
+E = O 
+M = M 
+C = P 
+U = U 
+R = T 
+O = E 
+T = R 
+
+Cenit - Polar makes this alphabet table:
+A	B	C	D	E	F	G	H	I	J	K	L	M	N	Ñ	O	P	Q	R	S	T	U	V	W	X	Y	Z
+I	B	P	D	O	F	G	H	A	J	K	N	M	L	Ñ	E	C	Q	T	S	R	U	V	W	X	Y	Z

Cenit-Polar-Crypt/Solution.js

@@ -0,0 +1,21 @@
+
+function processWord(encryptedWord){
+    let splitedText = (encryptedWord.toLowerCase()).split("");
+    let cenit = ["c", "e", "n", "i", "t"];
+    var polar = ["p", "o", "l", "a", "r"];
+    var encryptWordArray = [];
+    splitedText.map(function(i) {
+      if (cenit.indexOf(i) > -1) {
+        i = polar[cenit.indexOf(i)];
+        encryptWordArray.push(i);
+      } else if (polar.indexOf(i) > -1) {
+        i = cenit[polar.indexOf(i)];
+        encryptWordArray.push(i);
+      } else {
+        encryptWordArray.push(i);
+      }
+    });
+    return encryptWordArray.join("").toUpperCase();
+}
+
+console.log(processWord("COMPUTER"));