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) {
        int n = timePoints.size();
        int minm = INT_MAX;
        sort(timePoints.begin(), timePoints.end());

        auto process = [&](int i, int j) -> int {
            string s = timePoints[i];
            int hr = stoi(s.substr(0, 2));
            int mn = stoi(s.substr(3, 2));
            string t = timePoints[j];
            int hrp = stoi(t.substr(0, 2));
            int mnp = stoi(t.substr(3, 2));
            int diff = (hr - hrp) * 60 + (mn - mnp);
            return (diff + 1440) % 1440;
        };

        for (int i = 1; i < n; i++) {            
            minm = min(minm, process(i, i - 1));
        }
        minm = min(minm, process(0, n - 1));
        return minm;
    }
};
18400