Given a list of $24$-hour clock time points in "HH:MM" format, return the minimum difference in minutes between any two time points in timePoints.

Constraints:

• $2 \leq$ timePoints.length $\leq 2 \times 10^4$

• timePoints[i] is in the format "HH:MM"

The key insight is that the minimum time difference between any two clock times can be found by converting all times to a linear scale (total minutes from midnight), sorting them, and then comparing adjacent values. As the clock is circular (wraps around after $1439$ ...