Add solution #767

Author: JoshCrozier

README.md

@@ -581,6 +581,7 @@
 764|[Largest Plus Sign](./0764-largest-plus-sign.js)|Medium|
 765|[Couples Holding Hands](./0765-couples-holding-hands.js)|Hard|
 766|[Toeplitz Matrix](./0766-toeplitz-matrix.js)|Easy|
+767|[Reorganize String](./0767-reorganize-string.js)|Medium|
 783|[Minimum Distance Between BST Nodes](./0783-minimum-distance-between-bst-nodes.js)|Easy|
 784|[Letter Case Permutation](./0784-letter-case-permutation.js)|Medium|
 790|[Domino and Tromino Tiling](./0790-domino-and-tromino-tiling.js)|Medium|

solutions/0767-reorganize-string.js

@@ -0,0 +1,42 @@
+/**
+ * 767. Reorganize String
+ * https://leetcode.com/problems/reorganize-string/
+ * Difficulty: Medium
+ *
+ * Given a string s, rearrange the characters of s so that any two adjacent characters are
+ * not the same.
+ *
+ * Return any possible rearrangement of s or return "" if not possible.
+ */
+
+/**
+ * @param {string} s
+ * @return {string}
+ */
+var reorganizeString = function(s) {
+  const charCount = new Map();
+  for (const char of s) {
+    charCount.set(char, (charCount.get(char) || 0) + 1);
+  }
+
+  const maxHeap = [...charCount.entries()]
+    .sort((a, b) => b[1] - a[1]);
+
+  if (maxHeap[0][1] > Math.ceil(s.length / 2)) {
+    return '';
+  }
+
+  const result = [];
+  let index = 0;
+
+  while (maxHeap.length) {
+    const [char, count] = maxHeap.shift();
+    for (let i = 0; i < count; i++) {
+      result[index] = char;
+      index += 2;
+      if (index >= s.length) index = 1;
+    }
+  }
+
+  return result.join('');
+};