Meeting Rooms

Problem

Given an array of meeting time intervals where intervals[i] = [starti, endi], determine if a person could attend all meetings.

Example 1:

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

Example 2:

Input: intervals = [[7,10],[2,4]]
Output: true

Constraints:

  • 0 <= intervals.length <= 104
  • intervals[i].length == 2
  • 0 <= starti < endi <= 106

Solution

class Solution {
    public boolean canAttendMeetings(int[][] intervals) {
        Arrays.sort(intervals, (l, r) -> {
            return Integer.compare(l[0], r[0]);
        });
        var t = -1;
        for (var i : intervals) {
            if (t > i[0]) {
                // conflict
                return false;
            } else {
                t = i[1];
            }
        }

        return true;
    }
}

Recent posts from blogs that I like

Rewriting pycparser with the help of an LLM

pycparser is my most widely used open source project (with ~20M daily downloads from PyPI [1]). It's a pure-Python parser for the C programming language, producing ASTs inspired by Python's own. Until very recently, it's been using PLY: Python Lex-Yacc for the core parsing. In this post, I'll descri...

via Eli Bendersky

the disorientation of freedom

beyond words

via bookbear express

Distributing Go binaries like sqlite-scanner through PyPI using go-to-wheel

via Simon Willison