// 2024/08/21
// interviewer: Alisha
// interviewee: Ted

LC

### Q1 ----------------------------------
start time: 11:13
- [1,3][3,4]

n = schedules.size()
TC: O(nlogn)
SC: O(logn)

const cmp(vector<int>& a, vector<int>& b) {
    return a[0] < b[0];
}

bool fun(vector<vector<int>>& schedules) {
    sort(schedules.begin(), schedules.end(), cmp);
    
    for (int i = 1; i < schedules.size(); i++) {
        if (schedules[i - 1][1] > schedules[i][0]) {
            return false;
        }
    }
    return true;
}

finish time:

### Q2 ----------------------------------
start time: 11:17

Input: intervals = [[0,30],[5,10],[15,20]]
Output: 2

intervals: [[0,30],[5,10],[15,20]]

------------------------
-------
------

const cmp(vector<int>& a, vector<int>& b) {
    return a[0] < b[0];
}

int maxRoom(vector<vector<int>> intervals) {
    sort(schedules.begin(), schedules.end(), cmp);
    
    
}

finish time:

### Q3 ----------------------------------
start time:

finish time:

### feedback
1.
2.