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()

        min_time_diff = float('inf')
        i = 0
        while i < len(timePoints):
            min_time_diff = min(min_time_diff, self.diff(timePoints[i], timePoints[i-1]))
            i += 1

        return min_time_diff

    def diff(self, time1, time2):
        time1_in_minutes = int(time1[:2])*60 + int(time1[-2:])
        time2_in_minutes = int(time2[:2])*60 + int(time2[-2:])

        return min(abs(time1_in_minutes - time2_in_minutes), abs(time1_in_minutes + (24*60-time2_in_minutes)))

19300