solution for 1.2

Author: Ariana Davis

JavaScript/chapter01/1.1 - Is Unique/solution.js

@@ -4,9 +4,7 @@ Output: returns a deduped array of integers
 */
 
 // Solution using Set 
-
 const isUnique = (arr) => [...new Set(arr)];
 
 // Test Cases
-
 console.log(isUnique([1,1,1,2,2,2,2,3,3,3,3]) === [1,2,3]); 

JavaScript/chapter01/1.2 - Check Perm/solution.js

@@ -0,0 +1,18 @@
+/* Given two strings, write a method to decide 
+if one is permutation of the other */
+
+var checkPerm = function(stringOne,  stringTwo) {
+    //if different lengths, return false
+    if (stringOne.length !==  stringTwo.length ) {
+        return false; 
+    } 
+    //else sort & compare
+    else {
+        var sortStringOne = stringOne.split('').sort('').join('');
+        var sortStringTwo = stringTwo.split('').sort('').join('');
+        return sortStringOne === sortStringTwo;
+    }
+};
+
+//Tests 
+console.log(checkPerm('aba' , 'aab'), true);