chore(lab): add new exercises

* chore(lab): critial routers exercise

* solve the problem but with repetitions

* 🔧 chore (lab): solve the problem

* --wip-- [skip ci]

* --wip-- [skip ci]

* feat(lab): integer to words

* feat(lab): improve algo to cover corner cases

* chore(lab): alien dictionary exercise

* chore(lab): sum exercises added

* new exercise

* using dijkstra algorithm

* new exercises

* update exercises

* new exercise

* solution

* 🔧 chore eslint

Author: amejiarosario

.eslintrc.js

@@ -15,7 +15,8 @@ module.exports = {
 
     // https://eslint.org/docs/rules/no-plusplus
     // allows unary operators ++ and -- in the afterthought (final expression) of a for loop.
-    'no-plusplus': [2, { 'allowForLoopAfterthoughts': true }],
+    'no-plusplus': [0, { 'allowForLoopAfterthoughts': true }],
+    'no-continue': [0],
 
     // Allow for..of
     'no-restricted-syntax': [0, 'ForOfStatement'],

lab/exercises/10-mixed/2sum-1.js

@@ -0,0 +1,31 @@
+
+/**
+ * Given a SORTED array and a target, return the indices of the 2 number that sum up target
+ *
+ * @param {number[]} nums
+ * @param {numer} target
+ * @returns
+ *
+ * @runtime O(n)
+ */
+function twoSum(nums, target) {
+  const len = nums.length - 1;
+  let lo = 0;
+  let hi = len;
+
+  while (lo < hi && hi > 0 && lo < len) {
+    const sum = nums[lo] + nums[hi];
+    if (sum === target) {
+      return [lo, hi];
+    }
+    if (sum > target) {
+      hi--;
+    } else {
+      lo++;
+    }
+  }
+
+  return [];
+}
+
+module.exports = twoSum;