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>

unordered_map<string, int> TABLE;
class Solution {
public:
    int findMinDifference(vector<string>& timePoints) {
        auto evaluate = [&](const string& S) -> int {
            return TABLE.count(S) ? TABLE[S] : TABLE[S] = stoi(S.substr(0, 2)) * 60 + stoi(S.substr(3, 2));
        };
        // sort(timePoints.begin(), timePoints.end(), [&](const string& T1, const string& T2) -> bool {
        //     return evaluate(T1) < evaluate(T2);
        // });
        
        sort(timePoints.begin(), timePoints.end());
        
        int diff = evaluate(timePoints.back()) - evaluate(timePoints.front());
        int min_diff = min(1440 - diff, diff), n = timePoints.size();
        if (!min_diff) return min_diff;
        for (int i = 1; i < n; i++) {
            auto first = evaluate(timePoints[i - 1]);
            auto second = evaluate(timePoints[i]);
            min_diff = min(min_diff, second - first);
            if (!min_diff) return min_diff;
        }
        
        return min_diff;
    }
};
18100