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 {

    int toMinutes(const std::string& timePoint) {
        return ((timePoint[0] - '0') * 10 + timePoint[1] - '0') * 60 +  ((timePoint[3] - '0') * 10 + timePoint[4] - '0');
    }

public:
    int findMinDifference(vector<string>& timePoints) {
                
        std::sort(timePoints.begin(), timePoints.end());
        int prev = toMinutes(timePoints[0]);
        int result = toMinutes(timePoints[0]) + 24 * 60 - toMinutes(*timePoints.rbegin());

        for(int i = 1; i < timePoints.size(); ++i) {
            int current = toMinutes(timePoints[i]);            
            result = std::min(result, current - prev);
            prev = current;
        }


        return result;
    }
};
17200