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, t: List[str]) -> int:
        
        t.sort()

        a = -((int(t[0][0:2])-int(t[len(t)-1][0:2]))*60)+-(int(t[0][3:])-int(t[len(t)-1][3:]))
        mt = min(a,1440-a)

        for i in range(len(t)-1):
            a=0
            if t[i][0]>t[i+1][0]:
                a = ((int(t[i][0:2])-int(t[i+1][0:2]))*60)+(int(t[i][3:])-int(t[i+1][3:]))
            else:
                a = -((int(t[i][0:2])-int(t[i+1][0:2]))*60)+-(int(t[i][3:])-int(t[i+1][3:]))
            mt = min(mt, min(a,1440-a))
        
        return mt
19600