Add solution #1054

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,123 LeetCode solutions in JavaScript
+# 1,124 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -859,6 +859,7 @@
 1051|[Height Checker](./solutions/1051-height-checker.js)|Easy|
 1052|[Grumpy Bookstore Owner](./solutions/1052-grumpy-bookstore-owner.js)|Medium|
 1053|[Previous Permutation With One Swap](./solutions/1053-previous-permutation-with-one-swap.js)|Medium|
+1054|[Distant Barcodes](./solutions/1054-distant-barcodes.js)|Medium|
 1071|[Greatest Common Divisor of Strings](./solutions/1071-greatest-common-divisor-of-strings.js)|Easy|
 1072|[Flip Columns For Maximum Number of Equal Rows](./solutions/1072-flip-columns-for-maximum-number-of-equal-rows.js)|Medium|
 1073|[Adding Two Negabinary Numbers](./solutions/1073-adding-two-negabinary-numbers.js)|Medium|

solutions/1054-distant-barcodes.js

@@ -0,0 +1,37 @@
+/**
+ * 1054. Distant Barcodes
+ * https://leetcode.com/problems/distant-barcodes/
+ * Difficulty: Medium
+ *
+ * In a warehouse, there is a row of barcodes, where the ith barcode is barcodes[i].
+ *
+ * Rearrange the barcodes so that no two adjacent barcodes are equal. You may return any answer,
+ * and it is guaranteed an answer exists.
+ */
+
+/**
+ * @param {number[]} barcodes
+ * @return {number[]}
+ */
+var rearrangeBarcodes = function(barcodes) {
+  const frequencyMap = new Map();
+  for (const code of barcodes) {
+    frequencyMap.set(code, (frequencyMap.get(code) || 0) + 1);
+  }
+
+  const sortedCodes = [...frequencyMap.entries()]
+    .sort((a, b) => b[1] - a[1]);
+
+  const result = new Array(barcodes.length);
+  let index = 0;
+
+  for (const [code, count] of sortedCodes) {
+    for (let i = 0; i < count; i++) {
+      if (index >= barcodes.length) index = 1;
+      result[index] = code;
+      index += 2;
+    }
+  }
+
+  return result;
+};