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:
        valSet = set(timePoints)
        if len(valSet) != len(timePoints):
            return 0
        vals = []
        for timePoint in timePoints:
            hr, minute = timePoint.split(':')
            val = int(hr) * 60 + int(minute)
            vals.append(val)
        vals.sort()
        res = math.inf
        # 0 1439
        for i in range(len(timePoints)):
            res = min((vals[i] - vals[i - 1]) % 1440, res)
        return res




19600