more movings

Author: amejiarosario

lab/exercises/01-arrays/check-permutation.js

@@ -0,0 +1,23 @@
+/*
+1.2 Check Permutation: Given two strings,
+write a method to decide if one is a permutation of the other.
+*/
+function checkPermutation(a, b){
+  if(a.length !== b.length) return false;
+
+  chars = new Map();
+
+  a.split('').forEach((c) => chars.set(c, 1));
+
+  for(const c of b){
+    if(chars.get(c) !== 1) return false;
+  }
+  return true;
+}
+
+console.log(checkPermutation('123', '231'));
+console.log(checkPermutation('123', '456'));
+console.log(checkPermutation('123', '4231'));
+console.log(checkPermutation('4231', '123'));
+console.log(checkPermutation('God', 'dog'));
+console.log(checkPermutation('God ', 'dog'));

lab/exercises/01-arrays/one-away.js

@@ -0,0 +1,38 @@
+function isOneEditAway(str1, str2) {
+  let edit = 0;
+  let i1, i2;
+
+  if(Math.abs(str1.length - str2.length) > 1) {
+    return false;
+  }
+
+  for(i1 = 0, i2 = 0; i1 < str1.length && i2 < str2.length; i1++, i2++) {
+    if(str1[i1] === str2[i2]) {
+      continue;
+    } else {
+      edit++;
+
+      if(edit > 1){
+        return false;
+      } else if(str1.length > str2.length) {
+        i2--;
+      } else if(str1.length < str2.length) {
+        i1--;
+      } else {
+        continue;
+      }
+    }
+  }
+
+  return edit <= 1;
+}
+
+console.log(isOneEditAway('pale', 'pale')); // true
+console.log(isOneEditAway('pale', 'ale')); // true
+console.log(isOneEditAway('pale', 'pales')); // true
+console.log(isOneEditAway('pale', 'bale')); // true
+console.log(isOneEditAway('apple', 'aple')); // true
+
+console.log(isOneEditAway('pale', 'bae')); // false
+console.log(isOneEditAway('pale', 'elap')); // false
+console.log(isOneEditAway('pale', 'palepalepale')); // false