Add solution #1029

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,100 LeetCode solutions in JavaScript
+# 1,101 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -836,6 +836,7 @@
 1026|[Maximum Difference Between Node and Ancestor](./solutions/1026-maximum-difference-between-node-and-ancestor.js)|Medium|
 1027|[Longest Arithmetic Subsequence](./solutions/1027-longest-arithmetic-subsequence.js)|Medium|
 1028|[Recover a Tree From Preorder Traversal](./solutions/1028-recover-a-tree-from-preorder-traversal.js)|Hard|
+1029|[Two City Scheduling](./solutions/1029-two-city-scheduling.js)|Medium|
 1037|[Valid Boomerang](./solutions/1037-valid-boomerang.js)|Easy|
 1038|[Binary Search Tree to Greater Sum Tree](./solutions/1038-binary-search-tree-to-greater-sum-tree.js)|Medium|
 1041|[Robot Bounded In Circle](./solutions/1041-robot-bounded-in-circle.js)|Medium|

solutions/1029-two-city-scheduling.js

@@ -0,0 +1,26 @@
+/**
+ * 1029. Two City Scheduling
+ * https://leetcode.com/problems/two-city-scheduling/
+ * Difficulty: Medium
+ *
+ * A company is planning to interview 2n people. Given the array costs where
+ * costs[i] = [aCosti, bCosti], the cost of flying the ith person to city a is aCosti,
+ * and the cost of flying the ith person to city b is bCosti.
+ *
+ * Return the minimum cost to fly every person to a city such that exactly n people
+ * arrive in each city.
+ */
+
+/**
+ * @param {number[][]} costs
+ * @return {number}
+ */
+/**
+ * @param {number[][]} costs
+ * @return {number}
+ */
+var twoCitySchedCost = function(costs) {
+  return costs
+    .sort((a, b) => (a[0] - a[1]) - (b[0] - b[1]))
+    .reduce((sum, [a, b], index) => sum + (index < costs.length / 2 ? a : b), 0);
+};