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:
        timePoints.sort()

        def time_to_mins(t):
            h, m = map(int, t.split(":"))
            return 60 * h + m

        res = (
            24 * 60 - 
            time_to_mins(timePoints[-1]) +
            time_to_mins(timePoints[0])
        )
        for i in range(len(timePoints) - 1):
            cur = time_to_mins(timePoints[i + 1])
            prev = time_to_mins(timePoints[i])

            diff = cur - prev
            res = min(res, diff)
            if res == 0:
                return 0
        return res


19200