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:
    def findMinDifference(self, timePoints: List[str]) -> int:
        minutes = [False] * 24 * 60
        for time in timePoints:
            h, m = map(int, time.split(":"))
            new_min = h * 60 + m
            if minutes[new_min]:
                return 0
            minutes[new_min] = True
        
        prev_ind = float("inf")
        first_ind = float("inf")
        last_ind = float("inf")
        ans = float("inf")
        for i in range(24 * 60):
            if minutes[i]:
                if prev_ind != float("inf"):
                    ans = min(ans, i - prev_ind)
                prev_ind = i
                if first_ind == float("inf"):
                    first_ind = i
                last_ind = i
        return min(ans, 24 * 60 - last_ind + first_ind)
19500