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 convToMin(string s){
        int minutes = 0;
        int s1=stoi(s.substr(0, 2)), s2=stoi(s.substr(3, 2));
        minutes+=s1*60;
        minutes+=s2;
        return minutes;

    }
    int findMinDifference(vector<string>& a) {
        vector<int> v;
        for(auto it:a){
            v.push_back(convToMin(it));
        }
        sort(v.begin(), v.end());
        v.push_back(v[0]+1440);
        // for(auto it:v) cout<<it<<" ";
        int ans=1500;
        for(int i=1;i<v.size();i++){
            ans=min(ans, v[i]-v[i-1]);
        }
        return ans;
    }
};
18500