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 x){
        int x_hour=stoi(x.substr(0,2)),x_min=stoi(x.substr(3,2));
        return 60*x_hour + x_min;
    }
    int findMinDifference(vector<string>& timePoints) {
        int n=timePoints.size();
        vector<int>minutes;
        int mini=INT_MAX;
        for(string time: timePoints){
            minutes.push_back(convert(time));
        }
        sort(minutes.begin(),minutes.end());
        for(int i=0;i<n-1;i++){
            mini=min(mini,minutes[i+1]-minutes[i]);
        }
        if(minutes[0]+1440-minutes[n-1]>mini)
            return mini;
        else
            return minutes[0]+1440-minutes[n-1]; 
    }
};
18600