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 convert(string s) {
        return stoi(s.substr(0,2)) * 60 + stoi(s.substr(3,2)); 
    }
    int findMinDifference(vector<string>& t) {
        sort(t.begin(), t.end());
        int ans = INT_MAX;
        for(int i = 0; i < t.size() - 1; i++) {
            ans = min(ans, convert(t[i + 1]) - convert(t[i]));
        }
        int i = 0;
        int j = t.size() - 1;
        while(i < j) {
            int t1 = 1440 - convert(t[j]);
            int t2 = convert(t[i]);
            ans = min(ans, t1 + t2);
            i++;
            j--;
        }
        return ans;
    }
};
18200