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:
        if len(set(timePoints)) < len(timePoints):
            return 0
        
        parse =lambda x: datetime.datetime.strptime(x, "%H:%M")
        
        diff = lambda x, y: (parse(x)-parse(y)).seconds//60
        
        timePoints.sort(key = parse)
        
        timePoints += [timePoints[0]]
        
        n = len(timePoints)
        best = math.inf
        for i in range(n-1):
            best = min(best, diff(timePoints[i+1],timePoints[i]))
        
        return best
19900