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> arr;
        for (auto str: timePoints) {
            int hours = (str[0] - '0') * 10 + (str[1] - '0'); 
            int min = (str[3] - '0') * 10 + (str[4] - '0');

            int minutes = hours * 60 + min;
            arr.push_back(minutes);

            minutes += 24 * 60;
            arr.push_back(minutes);
        }

        sort(arr.begin(), arr.end());
        for (auto e: arr) {
            cout << e << endl;
        }


        int ans = INT_MAX;

        for (int i = 0; i < arr.size() - 1; ++i) {
            ans = min(ans, arr[i + 1] - arr[i]);
        }

        return ans;
    }
};
17800