Add solution #49

Author: JoshCrozier

README.md

@@ -20,6 +20,7 @@
 36|[Valid Sudoku](./0036-valid-sudoku.js)|Medium|
 41|[First Missing Positive](./0041-first-missing-positive.js)|Hard|
 43|[Multiply Strings](./0043-multiply-strings.js)|Medium|
+49|[Group Anagrams](./0049-group-anagrams.js)|Medium|
 50|[Pow(x, n)](./0050-powx-n.js)|Medium|
 54|[Spiral Matrix](./0054-spiral-matrix.js)|Medium|
 58|[Length of Last Word](./0058-length-of-last-word.js)|Easy|

solutions/0049-group-anagrams.js

@@ -0,0 +1,26 @@
+/**
+ * 49. Group Anagrams
+ * https://leetcode.com/problems/group-anagrams/
+ * Difficulty: Medium
+ *
+ * Given an array of strings `strs`, group the anagrams together. You can return the
+ * answer in any order.
+ *
+ * An Anagram is a word or phrase formed by rearranging the letters of a different
+ * word or phrase, typically using all the original letters exactly once.
+ */
+
+/**
+ * @param {string[]} strs
+ * @return {string[][]}
+ */
+var groupAnagrams = function(strs) {
+  const map = {};
+
+  strs.forEach(str => {
+    const key = [...str].sort();
+    map[key] = map[key] ? [...map[key], str] : [str];
+  });
+
+  return Object.values(map);
+};