[Java] Leetcode 252/253. Meeting Rooms I/II [Intervals #4]

preview_player
Показать описание
In this video, I'm going to show you how to solve Leetcode 252/253. Meeting Rooms I/II which is related to Intervals.

Here’s a quick rundown of what you’re about to learn:

Course Contents
(0:00​) Leetcode 252
(7:17​) Leetcode 253

In the end, you’ll have a really good understanding on how to solve Leetcode 252/253. Meeting Rooms I/II and questions that are similar to this Intervals.

Now, if you want to get good at Intervals, please checkout my Intervals playlist.

  1. Eric Programming
  2. leetcode Meeting Rooms I/II
  3. leetcode 253
  4. leetcode 253 Meeting Rooms I/II
  5. 253 Meeting Rooms I/II
  6. eric programming leetcode 253
Рекомендации по теме
[Java] Leetcode 252/253. 0:17:16

[Java] Leetcode 252/253. Meeting Rooms I/II [Intervals #4]

Meeting Rooms II 0:11:46

Meeting Rooms II - Leetcode 253 - Python

Leetcode 252/253 Meeting 0:15:26

Leetcode 252/253 Meeting Rooms I/II

Meeting Rooms 2 0:16:15

Meeting Rooms 2 (LeetCode 253 - Medium)

Meeting Rooms - 0:08:16

Meeting Rooms - Leetcode 252 - Python

[SOLVED!] Meeting Rooms 0:06:50

[SOLVED!] Meeting Rooms II - LeetCode 253 - Java

Meeting Rooms II 0:06:07

Meeting Rooms II

Meeting Rooms II 0:10:06

Meeting Rooms II - LeetCode 253 - Java - Two Pointers

LeetCode 253. Meeting 0:06:29

LeetCode 253. Meeting Rooms 2 Explanation and solution EP1

Meeting Rooms | 0:05:54

Meeting Rooms | Leetcode 252 | Java

𝗠𝗲𝗲𝘁𝗶𝗻𝗴 𝗥𝗼𝗼𝗺𝘀 𝟭 0:13:22

𝗠𝗲𝗲𝘁𝗶𝗻𝗴 𝗥𝗼𝗼𝗺𝘀 𝟭 𝗮𝗻𝗱 𝟮 | 𝗟𝗲𝗲𝘁𝗰𝗼𝗱𝗲 𝟮𝟱𝟮 𝗮𝗻𝗱 𝟮𝟱𝟯 | 𝗣𝗿𝗶𝗼𝗿𝗶𝘁𝘆 𝗤𝘂𝗲𝘂𝗲 𝗩𝗶𝘀𝘂𝗮𝗹𝗶𝘇𝗮𝘁𝗶𝗼𝗻 | 𝗣𝗵𝗮𝗻𝗶 𝗧𝗵𝗮𝘁𝗶𝗰𝗵𝗮𝗿𝗹𝗮...

Meeting Rooms II 0:09:08

Meeting Rooms II | Top Google Coding Interview Question

Meeting Rooms 0:04:47

Meeting Rooms

Leetcode 253. Meeting 0:11:02

Leetcode 253. Meeting Rooms II [Algo + Code + Time/Space Complexity]

Meeting Rooms II 0:28:08

Meeting Rooms II 30 Mins Coding Challenge

Leetcode 252. Meeting 0:09:39

Leetcode 252. Meeting Rooms [Algorithm + Code + Time Complexity]

LeetCode 253. Meeting 0:13:00

LeetCode 253. Meeting Rooms II

Meeting Rooms - 0:03:58

Meeting Rooms - LeetCode Premium - Coding Interview Questions

[Leetcode 252/253] Meeting 0:15:10

[Leetcode 252/253] Meeting Rooms I/II

Leetcode 253 - 0:12:53

Leetcode 253 - Meeting Rooms II - Amazon, Facebook Coding Interview

LeetCode 253 | 0:10:43

LeetCode 253 | Meeting Rooms II | TreeMap | Sweep Line | Debugger | Java

Leetcode 252 - 0:08:30

Leetcode 252 - Meeting Rooms - Amazon Coding Interview

Meeting Rooms - 0:01:57

Meeting Rooms - LeetCode 252 - Java Solution

PQ #2 : 0:19:44

PQ #2 : Meeting Rooms Leetcode Problem || Minimum Platforms Problem || Greedy Algorithm #dsa #sde

Комментарии
Автор

love the way how you walk through the problems
Thank you Eric

SHSelect
Автор

we can use priority queue to store the meeting end times, so retrieving the earliest meeting end times takes only O(1) and adding a new meeting end time to priority queue takes O(log n). Overall time complexity - O(nlogn).

Dylan
Автор

indexOf is a linear time operation, but your roomTime array doesnt scale with the input intervals array. So your overall time complexity is still O(nlogn)

Logan
Автор

I'm a little bit confused, the minHeap is to store the meetingRoom ending time, but at the beginning (i.e. line10), it stores the entire intervals (i.e. intervals[0]) rather than the ending time (14:50)?

pengx
Автор

Hm would the time complexity be O(n^2) in worst case?

JustinAllison
Автор

whould the time complexity of leetcode253 be O(nlogn) or o(n) + o(nlogn) ?

MeetManga