JavaScript Algorithms: Meeting Rooms (LeetCode)

Anatolii Kurochkin
Nov 24, 2020 · 2 min read


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

Input: intervals = [[0,30],[5,10],[15,20]]
Output: false
Input: intervals = [[7,10],[2,4]]
Output: true
  • intervals[i].length == 2
  • 0 <= starti < endi <= 106


I came up with a brute force solution when I had seen this question the first time. We can go through the intervals array and create a Set with all busy minutes. And if we see a minute that is already in Set we’re going to return false, otherwise return true.

Image for post
Image for post
Image for post
Image for post

JavaScript In Plain English

New JavaScript + Web Development articles every day.

Medium is an open platform where 170 million readers come to find insightful and dynamic thinking. Here, expert and undiscovered voices alike dive into the heart of any topic and bring new ideas to the surface. Learn more

Follow the writers, publications, and topics that matter to you, and you’ll see them on your homepage and in your inbox. Explore

If you have a story to tell, knowledge to share, or a perspective to offer — welcome home. It’s easy and free to post your thinking on any topic. Write on Medium

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store