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 findMinDifference(vector<string>& timePoints) {
        sort(timePoints.begin(), timePoints.end());
        int ans = INT_MAX;
        for (int i = 1; i < timePoints.size(); i++) {
            int h1 = (timePoints[i - 1][0] - '0') * 10 +
                     (timePoints[i - 1][1] - '0');
            int h2 = (timePoints[i][0] - '0') * 10 + (timePoints[i][1] - '0');
            int m1 = (timePoints[i - 1][3] - '0') * 10 +
                     (timePoints[i - 1][4] - '0');
            int m2 = (timePoints[i][3] - '0') * 10 + (timePoints[i][4] - '0');
            ans = min(ans, (((h2 - h1) * 60) + (m2 - m1)));
        }
        int n = timePoints.size();
        int h1 = (timePoints[0][0] - '0') * 10 + (timePoints[0][1] - '0');
        int h2 =
            (timePoints[n - 1][0] - '0') * 10 + (timePoints[n - 1][1] - '0');
        int m2 =
            (timePoints[n - 1][3] - '0') * 10 + (timePoints[n - 1][4] - '0');
        int m1 = (timePoints[0][3] - '0') * 10 + (timePoints[0][4] - '0');
        ans = min(ans, ((((23 - h2) + h1) * 60) + ((60 - m2 + m1))));
        return ans;
    }
};
17200