tag

#intervals

17 pages tagged

Practice › LeetCode › LeetCode (archived) › LeetCode 06xx ›

LeetCode 699: Falling Squares

Problem Restatement We are given a list of squares falling onto the X-axis. Each square is described by: [left, side_length] The square spans the interval: [left, left + side_length) The square falls vertically until: Situation Result It hits the ground Stops at height 0 It lands on another square Stacks on top After each square falls, we must report the maximum height among all squares so far. The official statement...

Practice › LeetCode › LeetCode (archived) › LeetCode 09xx ›

LeetCode 986: Interval List Intersections

Problem Restatement We are given two lists of closed intervals: firstList secondList Each list is sorted, and intervals inside the same list do not overlap. We need to return all intersections between intervals from the two lists. A closed interval [a, b] includes both endpoints. So [1, 5] and [5, 10] intersect at [5, 5] . The official constraints allow both lists to have length up to 1000 , and...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 759: Employee Free Time

Problem Restatement We are given the working schedules of several employees. Each employee has a list of non-overlapping intervals, sorted by start time. Each interval represents a time when that employee is busy. We need to return all finite, positive-length intervals when every employee is free. We do not include infinite intervals before the earliest busy time or after the latest busy time. Input and Output Item Meaning Input schedule...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 758: Bold Words in String

Problem Restatement We are given: words s words is a list of strings. s is the target string. We need to wrap substrings of s with: <b> ... </b> if those substrings match any word in words . There are two important rules: If two bold parts overlap, merge them into one bold section. If two bold parts are adjacent, merge them too. Return the final formatted string. Input and...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 757: Set Intersection Size At Least Two

Problem Restatement We are given a list of intervals. Each interval is: [start, end] We need to build a set S of integers such that every interval contains at least two numbers from S . Our goal is to make S as small as possible. Return the minimum possible size of S . Input and Output Item Meaning Input A list of intervals [start, end] Output The minimum size of...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 732: My Calendar III

Problem Restatement We need to implement a calendar. Each event is a half-open interval: [start, end) A new event can always be added. After each booking, we must return the largest number of events that overlap at any time. This value is called the maximum k -booking. A k -booking means there is some non-empty time interval where k events are active at the same time. The official problem defines...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 731: My Calendar II

Problem Restatement We need to implement a calendar that supports event bookings. Each booking is a half-open interval: [start, end) A booking is allowed if it does not create a triple booking. This means: One event overlapping another is allowed. Three events overlapping at the same time is forbidden. We must implement: book(start, end) Return: True if the event can be added. False if adding it would create a triple...

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 729: My Calendar I

Problem Restatement We need to implement a calendar. The calendar supports one operation: book(startTime, endTime) Each booking represents a half-open interval: [startTime, endTime) This means the event includes startTime , but does not include endTime . A new event can be added only if it does not create a double booking. A double booking happens when the new event overlaps with an existing event. If the event can be added,...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 495: Teemo Attacking

Problem Restatement Teemo attacks Ashe multiple times. We are given: Input Meaning timeSeries Times when Teemo attacks duration Poison duration after one attack When Ashe is poisoned, the poison lasts for exactly duration seconds. If another attack happens before the poison ends, the poison timer resets and continues from the new attack time. We need to return the total number of seconds Ashe is poisoned. Input and Output Item Meaning...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 436: Find Right Interval

Problem Restatement We are given a list of intervals. Each interval is: [start, end] For each interval i , we need to find another interval j such that: intervals[j][0] >= intervals[i][1] In words, interval j must start at or after interval i ends. Among all valid intervals, we need the one with the smallest start point. Return the original index of that interval. If no such interval exists, return -1...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 435: Non-overlapping Intervals

Problem Restatement We are given an array of intervals. Each interval has a start and an end: [start, end] We need to remove the minimum number of intervals so that the remaining intervals do not overlap. Two intervals that only touch at an endpoint do not overlap. For example: [1, 2] [2, 3] These can both remain, because the first interval ends exactly when the second interval starts. The official...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 57: Insert Interval

Problem Restatement We are given a list of non-overlapping intervals sorted by start time. Each interval has this form: [start, end] We are also given one new interval: newInterval = [start, end] We need to insert newInterval into the list so that the final list is still sorted and still has no overlapping intervals. If the new interval overlaps existing intervals, we merge them. The input intervals are already sorted...

Practice › LeetCode › LeetCode (archived) › LeetCode 00xx ›

LeetCode 56: Merge Intervals

Problem Restatement We are given an array of intervals. Each interval has a start and an end: [start, end] We need to merge all overlapping intervals and return a list of non-overlapping intervals that covers the same ranges as the original input. Two intervals overlap when the next interval starts before or exactly when the current interval ends. For example: [1, 4] and [4, 5] These overlap because they touch...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 253: Meeting Rooms II

Problem Restatement We are given a list of meeting intervals. Each interval is: [start, end] A meeting room can host only one meeting at a time. We need to determine the minimum number of meeting rooms required so that all meetings can happen without overlap. Input and Output Item Meaning Input A list of meeting intervals Output Minimum number of rooms required Interval [start, end] Goal Schedule all meetings without...

Practice › LeetCode › LeetCode (archived) › LeetCode 04xx ›

LeetCode 452: Minimum Number of Arrows to Burst Balloons

Problem Restatement We are given a list of balloons. Each balloon is represented by an interval: [xstart, xend] This means the balloon covers every horizontal position from xstart to xend , inclusive. An arrow is shot vertically upward from some x-coordinate x . The arrow bursts a balloon if: xstart <= x <= xend One arrow can burst many balloons if their intervals all contain the same x-coordinate. We need...

Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 352: Data Stream as Disjoint Intervals

Problem Restatement We need to design a data structure called SummaryRanges . It receives non-negative integers from a data stream, one number at a time. After each insertion, it should be able to return all numbers seen so far as a sorted list of disjoint intervals. For example, if the stream gives: 1, 3, 7, 2, 6 Then the intervals change like this: after 1: [[1, 1]] after 3: [[1,...

Practice › LeetCode › LeetCode (archived) › LeetCode 02xx ›

LeetCode 252: Meeting Rooms

Problem Restatement We are given a list of meeting time intervals. Each interval contains: [start, end] A person can attend all meetings only if none of the meetings overlap. We need to return: True if all meetings can be attended False if at least two meetings overlap Two meetings overlap when one meeting starts before another meeting finishes. Input and Output Item Meaning Input A list of meeting intervals Output...