text: # Time:  O(nlogn)
  # Space: O(n)
  
  class Solution(object):
      def findMinDifference(self, timePoints):
          """
          :type timePoints: List[str]
          :rtype: int
          """
          minutes = map(lambda x: int(x[:2]) * 60 + int(x[3:]), timePoints)
          minutes.sort()
          return min((y - x) % (24 * 60)  \
                     for x, y in zip(minutes, minutes[1:] + minutes[:1]))
  
  