Given a list of 24-hour clock time points in <strong>&quot;HH:MM&quot;</strong> format, return <em>the minimum <b>minutes</b> difference between any two time-points in the list</em>.
<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> timePoints = ["23:59","00:00"]
<strong>Output:</strong> 1
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> timePoints = ["00:00","23:59","00:00"]
<strong>Output:</strong> 0
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>2 &lt;= timePoints.length &lt;= 2 * 10<sup>4</sup></code></li>
	<li><code>timePoints[i]</code> is in the format <strong>&quot;HH:MM&quot;</strong>.</li>
</ul>

class Solution {
public:
    // time/space: O(nlogn)/O(n)
    int findMinDifference(vector<string>& timePoints) {
        int n = timePoints.size();
        vector<int> times;
        for (auto& tp : timePoints) {
            int time = ((tp[0] - '0') * 10 + (tp[1] - '0')) * 60 + ((tp[3] - '0') * 10 + (tp[4] - '0'));
            times.push_back(time);
            times.push_back(time + 24 * 60);
        }
        sort(times.begin(), times.end());

        int minDiff = INT_MAX;
        for (int i = 1 ; i < times.size(); i++) minDiff = min(minDiff, times[i] - times[i - 1]);
        return minDiff;
    }
};
17900