add: solution for find-anagrams

Author: supercodestart

find-anagrams/README.md

@@ -0,0 +1,28 @@
+# Find All The Anagrams
+
+Find all the anagrams within a series of words provided.
+
+e.g.:
+
+```console
+'eat', 'ate', 'tea', 'monk', 'konm', 'nkom', 'bbc', 'cbb', 'dell', 'ledl', 'llde'
+```
+
+```console
+[
+  ['eat', 'ate', 'tea'],
+  ['monk', 'konm', 'nkom'],
+  ['bbc', 'cbb'],
+  ['dell', 'ledl', 'llde'],
+]
+```
+
+## What is an Anagram?
+
+Anagrams are words or phrases you spell by rearranging the letters of another word or phrase. For instance, fans of the Harry Potter series know that Lord Voldemort's full name is actually an anagram of his birth name, and some people even play games challenging one another to make anagrams still relevant to the original term. For example, "schoolmaster" can be turned into "the classroom", "punishments" becomes "nine thumps", and "debit card" turns into "bad credit".
+
+## Execute
+
+```bash
+node solution.js
+```

find-anagrams/solution.js

@@ -0,0 +1,44 @@
+const sortWord = (word) => {
+  return word.split('').sort().join('');
+};
+
+const findAnagrams = (words) => {
+  let result = [];
+  while (words.length) {
+    const baseWord = words.shift();
+    const group = [baseWord];
+    const removeIndices = [];
+    for (let i = 0; i < words.length; i++) {
+      const word = words[i];
+      if (word.length !== baseWord.length) {
+        continue;
+      }
+      if (sortWord(baseWord) === sortWord(word)) {
+        group.push(word);
+        removeIndices.push(i);
+      }
+    }
+    while (removeIndices.length) {
+      words.splice(removeIndices.pop(), 1);
+    }
+    result.push(group);
+  }
+  return result;
+};
+
+(() => {
+  const words = [
+    'eat',
+    'ate',
+    'tea',
+    'monk',
+    'konm',
+    'nkom',
+    'bbc',
+    'cbb',
+    'dell',
+    'ledl',
+    'llde',
+  ];
+  console.log(findAnagrams(words));
+})();