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:
        final_arr = self.bucketSort(timePoints)
        #print(final_arr)
        min_diff = 1000
        for index in range(len(final_arr) - 1):
            min_diff = min(min_diff,self.diffTime(final_arr[index],final_arr[index + 1]))

        return min_diff
    
    def diffTime(self,small_time,big_time):
        diff = 0
        #add min for small
        diff += 60 - int(small_time[3::])
        #add hour
        diff += (int(big_time[:2:]) - (int(small_time[:2:]) + 1)) * 60
        #add min for big
        diff += int(big_time[3::])
        return diff
    
    def bucketSort(self,hours):
        buckets = [[] for _ in range(24)]

        for time in hours:
            hour, minute = map(int, time.split(":"))
            buckets[hour].append(minute)

        sorted_times = []
        for hour in range(24):
            for minute in sorted(buckets[hour]):
                sorted_times.append(f"{hour:02}:{minute:02}")
        
        time = sorted_times[0]
        anthoer_hour = str(24+int(time[0:2])) + time[2::]
        sorted_times.append(anthoer_hour)

        return sorted_times


20000