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:
    int toMinutes(string &s) {
        const int adj = (600 + 60 + 10 + 1) * '0'; 
        return 600 * s[0] + 60 * s[1] + 10 * s[3] + s[4] - adj;
    }
    int findMinDifference(vector<string>& timePoints) {
        sort(timePoints.begin(), timePoints.end());
        int prev = -(1440 - toMinutes(timePoints.back()));
        int minDiff = INT_MAX;
        for (string &s : timePoints) {
            int cur = toMinutes(s);
            minDiff = min(minDiff, abs(cur - prev));
            prev = cur;
        }
        return minDiff;
    }
};
17000