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:
    // bool comparator(auto x, auto y){
    //     if(x)
    // }
    int getT(string& s){
        return ((s[0]-'0')*10+s[1]-'0')*60+(s[3]-'0')*10+(s[4]-'0');
    }
    int findMinDifference(vector<string>& timePoints) {
        int n = timePoints.size();
        sort(timePoints.begin(), timePoints.end());
        int mindiff = INT_MAX;
        for(int i=0;i<n-1;i++){
            mindiff = min(mindiff, abs(getT(timePoints[i]) - getT(timePoints[i+1])));
        }
        mindiff =  min(mindiff, abs(getT(timePoints[n-1]) - (getT(timePoints[0])+1440)));
        return mindiff;
    }
};
17000