Add solution #539

Author: JoshCrozier

README.md

@@ -429,6 +429,7 @@
 532|[K-diff Pairs in an Array](./0532-k-diff-pairs-in-an-array.js)|Medium|
 537|[Complex Number Multiplication](./0537-complex-number-multiplication.js)|Medium|
 538|[Convert BST to Greater Tree](./0538-convert-bst-to-greater-tree.js)|Medium|
+539|[Minimum Time Difference](./0539-minimum-time-difference.js)|Medium|
 541|[Reverse String II](./0541-reverse-string-ii.js)|Easy|
 542|[01 Matrix](./0542-01-matrix.js)|Medium|
 543|[Diameter of Binary Tree](./0543-diameter-of-binary-tree.js)|Easy|

solutions/0539-minimum-time-difference.js

@@ -0,0 +1,26 @@
+/**
+ * 539. Minimum Time Difference
+ * https://leetcode.com/problems/minimum-time-difference/
+ * Difficulty: Medium
+ *
+ * Given a list of 24-hour clock time points in "HH:MM" format, return the minimum minutes
+ * difference between any two time-points in the list.
+ */
+
+/**
+ * @param {string[]} timePoints
+ * @return {number}
+ */
+var findMinDifference = function(timePoints) {
+  const minutes = timePoints.map(time => {
+    const [h, m] = time.split(':').map(Number);
+    return h * 60 + m;
+  }).sort((a, b) => a - b);
+  let diff = Infinity;
+
+  for (let i = 1; i < minutes.length; i++) {
+    diff = Math.min(diff, minutes[i] - minutes[i - 1]);
+  }
+
+  return Math.min(diff, 1440 - minutes[minutes.length - 1] + minutes[0]);
+};