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) {
        vector<int > minarray(timePoints.size());
       for(int i=0; i < timePoints.size(); i++){
        string x = timePoints[i];
        string hs= x.substr(0,2);
        string ms= x.substr(3,2);

        int hm = stoi(hs) *60;
        int m = stoi(ms) + hm;

       minarray[i] = m;
       }
        
        sort(minarray.begin(),minarray.end());
        int mini = INT_MAX;
        for(int i=0;i< minarray.size()-1;i++){
            int d= minarray[i+1] - minarray[i];
            mini = min(d,mini);
        }
        
      mini=  min(mini, (24*60 - minarray[minarray.size()-1]) + minarray[0]);
        

        return mini;
    }
};
17300