Given an array of meeting time intervals [start, end], determine if a person could attend all meetings (no two meetings overlap).

Input: [[0,30],[5,10],[15,20]] → Output: falseInput: [[7,10],[2,4]] → Output: true

Sort by start time. Check if any consecutive pair overlaps: intervals[i].start < intervals[i-1].end.

import java.util.*; class Solution { public boolean canAttendMeetings(int[][] intervals) { Arrays.sort(intervals, (a,b) -> a[0] - b[0]); for (int i = 1; i < intervals.length; i++) if (intervals[i][0] < intervals[i-1][1]) return false; return true; } }