Add solution #517

Author: JoshCrozier

README.md

@@ -413,6 +413,7 @@
 514|[Freedom Trail](./0514-freedom-trail.js)|Hard|
 515|[Find Largest Value in Each Tree Row](./0515-find-largest-value-in-each-tree-row.js)|Medium|
 516|[Longest Palindromic Subsequence](./0516-longest-palindromic-subsequence.js)|Medium|
+517|[Super Washing Machines](./0517-super-washing-machines.js)|Hard|
 520|[Detect Capital](./0520-detect-capital.js)|Easy|
 521|[Longest Uncommon Subsequence I](./0521-longest-uncommon-subsequence-i.js)|Easy|
 530|[Minimum Absolute Difference in BST](./0530-minimum-absolute-difference-in-bst.js)|Easy|

solutions/0517-super-washing-machines.js

@@ -0,0 +1,32 @@
+/**
+ * 517. Super Washing Machines
+ * https://leetcode.com/problems/super-washing-machines/
+ * Difficulty: Hard
+ *
+ * You have n super washing machines on a line. Initially, each washing machine has some
+ * dresses or is empty.
+ *
+ * For each move, you could choose any m (1 <= m <= n) washing machines, and pass one dress
+ * of each washing machine to one of its adjacent washing machines at the same time.
+ *
+ * Given an integer array machines representing the number of dresses in each washing machine
+ * from left to right on the line, return the minimum number of moves to make all the washing
+ * machines have the same number of dresses. If it is not possible to do it, return -1.
+ */
+
+/**
+ * @param {number[]} machines
+ * @return {number}
+ */
+var findMinMoves = function(machines) {
+  const total = machines.reduce((sum, num) => sum + num, 0);
+  const target = total / machines.length;
+  if (total % machines.length !== 0) return -1;
+
+  let result = 0;
+  for (let i = 0, balance = 0; i < machines.length; i++) {
+    balance += machines[i] - target;
+    result = Math.max(result, Math.abs(balance), machines[i] - target);
+  }
+  return result;
+};