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

My fireside chat about agentic engineering at the Pragmatic Summit

via Simon Willison

A weekend with Misia: 1

After marrying her cousin, the couple entertained Proust, Mallarmé, Gide, Debussy, and were patrons of Monet, Renoir, Odilon Redon, Signac and Toulouse-Lautrec.

via The Eclectic Light Company

Big tech engineers need big egos

It’s a common position among software engineers that big egos have no place in tech1. This is understandable - we’ve all worked with some insufferably overconfident engineers who needed their egos checked - but I don’t think it’s correct. In fact, I don’t know if it’s possible to survive as a softwa...

via Sean Goedecke