chore: apply prettier all files❤️

supercodestart · supercodestart · commit f9bb6813b75b · 2024-03-19T20:00:44.000-07:00
diff --git a/convert-string-to-group/solution.js b/convert-string-to-group/solution.js
@@ -6,36 +6,26 @@ const solution = (optionRule) => {
 
   const convert = (groupRule) => {
     for (const delimiter of delimiters) {
-      const regDelimiter = new RegExp(
-        `[ ]*${delimiter}[ ]*`,
-      );
+      const regDelimiter = new RegExp(`[ ]*${delimiter}[ ]*`);
       if (!regDelimiter.test(groupRule)) {
         continue;
       }
       stack.push({
-        [delimiter]: groupRule
-          .split(regDelimiter)
-          .map((rule) => {
-            const option = Number(rule.replace(/\D/g, ''));
+        [delimiter]: groupRule.split(regDelimiter).map((rule) => {
+          const option = Number(rule.replace(/\D/g, ''));
 
-            return (
-              (/^#\d+#$/.test(rule) && stack[option - 1]) ||
-              option
-            );
-          }),
+          return (/^#\d+#$/.test(rule) && stack[option - 1]) || option;
+        }),
       });
       break;
     }
   };
 
   while (groupPattern.test(currentRule)) {
-    currentRule = currentRule.replace(
-      groupPattern,
-      (match) => {
-        convert(match.substring(1, match.length - 1));
-        return `#${stack.length}#`;
-      },
-    );
+    currentRule = currentRule.replace(groupPattern, (match) => {
+      convert(match.substring(1, match.length - 1));
+      return `#${stack.length}#`;
+    });
   }
 
   convert(currentRule);
@@ -45,12 +35,6 @@ const solution = (optionRule) => {
 
 (() => {
   console.log(
-    JSON.stringify(
-      solution(
-        '{1069} AND ({1070} OR {1071} OR {1072}) AND {1244} AND ({1245} OR {1339})',
-      ),
-      null,
-      2,
-    ),
+    JSON.stringify(solution('{1069} AND ({1070} OR {1071} OR {1072}) AND {1244} AND ({1245} OR {1339})'), null, 2),
   );
 })();
diff --git a/delete-overlapping-intervals/solution.js b/delete-overlapping-intervals/solution.js
@@ -1,27 +1,17 @@
 const sortIntervals = ([aStart, aEnd], [bStart, bEnd]) =>
-  aStart > bStart || (aStart === bStart && aEnd > bEnd)
-    ? 1
-    : -1;
+  aStart > bStart || (aStart === bStart && aEnd > bEnd) ? 1 : -1;
 
-const doIntersect = ([aStart, aEnd], [bStart, bEnd]) =>
-  aStart <= bEnd && aEnd >= bStart;
+const doIntersect = ([aStart, aEnd], [bStart, bEnd]) => aStart <= bEnd && aEnd >= bStart;
 
-const combineIntervals = (
-  [aStart, aEnd],
-  [bStart, bEnd],
-) => [Math.min(aStart, bStart), Math.max(aEnd, bEnd)];
+const combineIntervals = ([aStart, aEnd], [bStart, bEnd]) => [Math.min(aStart, bStart), Math.max(aEnd, bEnd)];
 
 const solution = (intervals) =>
   intervals
     .sort(sortIntervals)
     .reduce(
       (merged, currentSeg) =>
         merged.some((seg) => doIntersect(seg, currentSeg))
-          ? merged.map((seg) =>
-              doIntersect(seg, currentSeg)
-                ? combineIntervals(seg, currentSeg)
-                : seg,
-            )
+          ? merged.map((seg) => (doIntersect(seg, currentSeg) ? combineIntervals(seg, currentSeg) : seg))
           : [...merged, currentSeg],
       [],
     );
diff --git a/filling-all-the-missed-angle-brackets/solution.js b/filling-all-the-missed-angle-brackets/solution.js
@@ -4,13 +4,8 @@ const solution = (angles) => {
     missedAngles = missedAngles.replace(/<>/g, '');
   }
   const missedOpens = missedAngles.replace(/</g, '').length;
-  const missedCloses = missedAngles.replace(
-    />/g,
-    '',
-  ).length;
-  return `${'<'.repeat(missedOpens)}${angles}${'>'.repeat(
-    missedCloses,
-  )}`;
+  const missedCloses = missedAngles.replace(/>/g, '').length;
+  return `${'<'.repeat(missedOpens)}${angles}${'>'.repeat(missedCloses)}`;
 };
 
 (() => {
diff --git a/finding-all-the-anagrams/solution.js b/finding-all-the-anagrams/solution.js
@@ -27,18 +27,6 @@ const findAnagrams = (words) => {
 };
 
 (() => {
-  const words = [
-    'eat',
-    'ate',
-    'tea',
-    'monk',
-    'konm',
-    'nkom',
-    'bbc',
-    'cbb',
-    'dell',
-    'ledl',
-    'llde',
-  ];
+  const words = ['eat', 'ate', 'tea', 'monk', 'konm', 'nkom', 'bbc', 'cbb', 'dell', 'ledl', 'llde'];
   console.log(findAnagrams(words));
 })();
diff --git a/finding-the-maximum-depth-of-a-binary-tree/solution.js b/finding-the-maximum-depth-of-a-binary-tree/solution.js
@@ -1,15 +1,6 @@
 const solution = (tree) => {
-  const makeNode = (
-    values,
-    offset = 0,
-    index = 0,
-    depth = 0,
-  ) => {
-    if (
-      !values ||
-      index >= values.length ||
-      values[index] === -1
-    ) {
+  const makeNode = (values, offset = 0, index = 0, depth = 0) => {
+    if (!values || index >= values.length || values[index] === -1) {
       return null;
     }
     const left = Math.pow(2, depth) + index + offset;
@@ -38,9 +29,7 @@ const solution = (tree) => {
 
 (() => {
   const tree = [
-    1, 2, 3, 4, -1, 5, 6, -1, -1, -1, -1, 7, 8, -1, 9, -1,
-    -1, -1, -1, -1, -1, -1, -1, -1, -1, 10, -1, -1, -1, 11,
-    -1,
+    1, 2, 3, 4, -1, 5, 6, -1, -1, -1, -1, 7, 8, -1, 9, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 10, -1, -1, -1, 11, -1,
   ];
   console.log(solution(tree));
 })();
diff --git a/fixing-setting-up-a-callback/README.md b/fixing-setting-up-a-callback/README.md
@@ -15,9 +15,7 @@ const solution = (messages) => {
     }
 
     trigger() {
-      this.messages.forEach((message) =>
-        this.event(message),
-      );
+      this.messages.forEach((message) => this.event(message));
     }
   }
 
diff --git a/fixing-setting-up-a-callback/solution.js b/fixing-setting-up-a-callback/solution.js
@@ -10,9 +10,7 @@ const solution = (messages) => {
     }
 
     trigger() {
-      this.messages.forEach((message) =>
-        this.event(message),
-      );
+      this.messages.forEach((message) => this.event(message));
     }
   }
 
@@ -36,12 +34,5 @@ const solution = (messages) => {
 };
 
 (() => {
-  console.log(
-    solution([
-      'Hello~',
-      'Can you hear me?',
-      'Nice to meet you.',
-      'This is a test message.',
-    ]),
-  );
+  console.log(solution(['Hello~', 'Can you hear me?', 'Nice to meet you.', 'This is a test message.']));
 })();
diff --git a/frequency-of-alphabet-letters/solution.js b/frequency-of-alphabet-letters/solution.js
@@ -7,10 +7,7 @@ function g(str) {
   while (codeA <= codeZ) {
     const letter = String.fromCharCode(codeA++);
 
-    letterFrequencies[letter] = str.replace(
-      new RegExp(`[^${letter}]`, 'gi'),
-      '',
-    ).length;
+    letterFrequencies[letter] = str.replace(new RegExp(`[^${letter}]`, 'gi'), '').length;
   }
 
   return letterFrequencies;
diff --git a/getting-the-distinct-transactions/solution.js b/getting-the-distinct-transactions/solution.js
@@ -14,9 +14,7 @@ const solution = (transactions, taxRate) => {
 
   const distinctTransactions = new Set(transactions);
 
-  Array.from(distinctTransactions).map(
-    computeTotal(taxRate),
-  );
+  Array.from(distinctTransactions).map(computeTotal(taxRate));
 
   return numCalls;
 };
diff --git a/replacing-characters/solution.js b/replacing-characters/solution.js
@@ -8,11 +8,8 @@ function f(str) {
   const reAlphabets = /[A-Za-z]/g;
 
   const fnReplacer = (substr) => {
-    const offset =
-      substr.toUpperCase().charCodeAt(0) - codeA;
-    return String.fromCharCode(
-      substr.charCodeAt(0) + 25 - 2 * offset,
-    );
+    const offset = substr.toUpperCase().charCodeAt(0) - codeA;
+    return String.fromCharCode(substr.charCodeAt(0) + 25 - 2 * offset);
   };
 
   return str.replace(reAlphabets, fnReplacer);
@@ -28,7 +25,5 @@ function solution(str) {
 (() => {
   solution('acp123!@#');
 
-  solution(
-    'Errors in strategy cannot be correct through tactical maneuvers',
-  );
+  solution('Errors in strategy cannot be correct through tactical maneuvers');
 })();
diff --git a/replacing-with-the-cipher-letters/solution.js b/replacing-with-the-cipher-letters/solution.js
@@ -1,10 +1,5 @@
 const solution = (word, cipher) => {
-  if (
-    !/^[a-z]+$/.test(word) ||
-    !word ||
-    !cipher ||
-    cipher.length !== 26
-  ) {
+  if (!/^[a-z]+$/.test(word) || !word || !cipher || cipher.length !== 26) {
     return '';
   }
   let result = '';
@@ -20,7 +15,5 @@ const solution = (word, cipher) => {
 };
 
 (() => {
-  console.log(
-    solution('helloworld', 'zyxwvutsrqponmlkjihgfedcba'),
-  );
+  console.log(solution('helloworld', 'zyxwvutsrqponmlkjihgfedcba'));
 })();
diff --git a/throttle-queue/solution.js b/throttle-queue/solution.js
@@ -9,10 +9,13 @@ function returnSlow() {
     const myI = i;
     i++;
     console.log('started ' + myI);
-    setTimeout(() => {
-      console.log('ended ' + myI);
-      resolve(getRandomInt(10));
-    }, getRandomInt(8) * 100 + 200);
+    setTimeout(
+      () => {
+        console.log('ended ' + myI);
+        resolve(getRandomInt(10));
+      },
+      getRandomInt(8) * 100 + 200,
+    );
   });
 }
 
@@ -37,20 +40,14 @@ function throttleQ(queue, n, result) {
     subQueue.push(queue.shift());
   }
 
-  return Promise.all(subQueue.map((fn) => fn())).then(
-    (subResult) => {
-      const resultAcc = [...(result ?? []), ...subResult];
-      return queue.length
-        ? throttleQ(queue, n, resultAcc)
-        : resultAcc;
-    },
-  );
+  return Promise.all(subQueue.map((fn) => fn())).then((subResult) => {
+    const resultAcc = [...(result ?? []), ...subResult];
+    return queue.length ? throttleQ(queue, n, resultAcc) : resultAcc;
+  });
 }
 
 (async () => {
-  const fns = [...Array(25)].map((_, i) =>
-    returnSlow.bind(null, i),
-  );
+  const fns = [...Array(25)].map((_, i) => returnSlow.bind(null, i));
 
   const promises = await throttleQ(fns, 6);
 
diff --git a/validating-a-maze-path/solution.js b/validating-a-maze-path/solution.js
@@ -1,14 +1,5 @@
-const solution = (
-  maze,
-  startRow,
-  startCol,
-  destRow,
-  destCol,
-) => {
-  if (
-    maze[startRow][startCol] == 1 ||
-    maze[destRow][destCol] == 1
-  ) {
+const solution = (maze, startRow, startCol, destRow, destCol) => {
+  if (maze[startRow][startCol] == 1 || maze[destRow][destCol] == 1) {
     return false;
   }
 
@@ -27,15 +18,10 @@ const solution = (
     [...slots].forEach((slot) => {
       tried.push(slot);
 
-      slots = slots.filter(
-        (s) => !(s.row == slot.row && s.col == slot.col),
-      );
+      slots = slots.filter((s) => !(s.row == slot.row && s.col == slot.col));
 
       for (const step of steps) {
-        if (
-          slot.row + step.row == destRow &&
-          slot.col + step.col == destCol
-        ) {
+        if (slot.row + step.row == destRow && slot.col + step.col == destCol) {
           path = true;
           return;
         }
@@ -47,20 +33,11 @@ const solution = (
           col: slot.col + step.col,
         };
 
-        if (
-          next.row < 0 ||
-          next.row >= maze.length ||
-          next.col < 0 ||
-          next.col >= maze[0].length
-        ) {
+        if (next.row < 0 || next.row >= maze.length || next.col < 0 || next.col >= maze[0].length) {
           continue;
         }
 
-        if (
-          tried.find(
-            (t) => t.row == next.row && t.col == next.col,
-          )
-        ) {
+        if (tried.find((t) => t.row == next.row && t.col == next.col)) {
           continue;
         }
 

Original file line number	Diff line number	Diff line change
`@@ -15,9 +15,7 @@ const solution = (messages) => {`
`15`	`15`	`}`
`16`	`16`
`17`	`17`	`trigger() {`
`18`		`- this.messages.forEach((message) =>`
`19`		`- this.event(message),`
`20`		`- );`
	`18`	`+ this.messages.forEach((message) => this.event(message));`
`21`	`19`	`}`
`22`	`20`	`}`
`23`	`21`