Conflicting Appointments (medium)

If you want to flex in your Java interview, you can use the comparator like this as well,

Arrays.sort(intervals, Comparator.comparingInt(i->i.start));

#class Interval:
#  def __init__(self, start, end):
#    self.start = start
#    self.end = end

#  def print_interval(self):
#    print("[" + str(self.start) + ", " + str(self.end) + "]", end='')


class Solution:
  def canAttendAllAppointments(self, intervals):
    
    def do_overlap(a, b):
      return b.start < a.end
    
    # sort the intervals first to compare the overlapping intervals
    intervals.sort(key = lambda x: x.start)
    
    for i in range(1, len(intervals)):
      # check the interval and the previous interval for overlapping 
      if do_overlap(intervals[i - 1], intervals[i]):
        return False
    
    return True

In the solution, an interval is implemented as a list of lists. In the problem, an interval is implemented as a class as in 'Merge Intervals'. Therefore, the solution provided does not work.