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:
    // Helper function to convert "HH:MM" to total minutes
    int convertToMinutes(const string& time) {
        int hours = stoi(time.substr(0, 2));
        int minutes = stoi(time.substr(3, 2));
        return hours * 60 + minutes;
    }
    
    int findMinDifference(vector<string>& timePoints) {
        // Step 1: Convert time points to minutes
        vector<int> minutes;
        for (const string& time : timePoints) {
            minutes.push_back(convertToMinutes(time));
        }
        
        // Step 2: Sort the list of time points in minutes
        sort(minutes.begin(), minutes.end());
        
        // Step 3: Find the minimum difference between consecutive times
        int minDiff = INT_MAX;
        for (int i = 1; i < minutes.size(); ++i) {
            minDiff = min(minDiff, minutes[i] - minutes[i - 1]);
        }
        
        // Step 4: Consider the circular difference between the first and last time point
        int circularDiff = 1440 - minutes.back() + minutes[0];
        minDiff = min(minDiff, circularDiff);
        
        return minDiff;
    }
};
18600