Learn DSA
Depth-First Search
Greedy Algorithms
Intervals
Can Attend Meetings
easy
DESCRIPTION (credit Leetcode.com)
Write a function to check if a person can attend all the meetings scheduled without any time conflicts. Given an array intervals, where each element [s1, e1] represents a meeting starting at time s1 and ending at time e1, determine if there are any overlapping meetings. If there is no overlap between any meetings, return true; otherwise, return false.
Note that meetings ending and starting at the same time, such as (0,5) and (5,10), do not conflict.
Input:
Output:
Explanation: The meetings (1,5) and (3,9) overlap.
Input:
Output:
true
Explanation: There are no overlapping meetings, so the person can attend all.
Explanation
Solution
can attend meetings
0 / 5
Test Your Knowledge
Login to take the complexity quiz and track your progress
Complexity Analysis
Time Complexity: O(n * logn) where n
is the number of intervals. The time complexity is dominated by the sorting step.
Space Complexity: O(1) We are not using any extra space beyond a few variables.
Login to track your progress
Your account is free and you can post anonymously if you choose.