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> time_minutes;
        vector<int> minimum;
        for(int i=0;i<timePoints.size();i++)
        {
            int hours=stoi(timePoints[i].substr(0,2));
            int minutes=stoi(timePoints[i].substr(3,2));
            time_minutes.push_back(hours*60+minutes);
        }
        sort(time_minutes.begin(),time_minutes.end());
        minimum.push_back(min((time_minutes[1]-time_minutes[0]),1440-(time_minutes[time_minutes.size()-1]-time_minutes[0])));
        for(int i=1;i<time_minutes.size()-1;i++)
        {   
            minimum.push_back(min((time_minutes[i+1]-time_minutes[i]),(time_minutes[i]-time_minutes[i-1])));
        }
        int min=INT_MAX;
        for(int i=0;i<minimum.size();i++)
         {
            if(minimum[i]<min)
               min=minimum[i];
         }
         return min;
    }
};

auto init = []() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    return 'c';
}();
18000