Similar Topics

Web Technologies32.1K+ articles

DSA20.5K+ articles

Arrays4.2K+ articles

Greedy1.4K+ articles

Sorting1.1K+ articles

Dynamic Programming1.1K+ articles

cpp-vector376+ articles

Arrays263+ articles

Hash150+ articles

Facebook87+ articles

Interval

17 posts

Meeting rooms - Find minimum meeting rooms

Last Updated: 23 July 2025

Given two arrays start[] and end[] such that start[i] is the starting time of ith meeting and end[i] is the ending time of ith meeting. Task is to find minimum number of r...read more

Meeting Rooms - Check if a person can attend all meetings

Last Updated: 15 July 2025

Given a 2D array arr[][] where arr[i][0] represents the starting time and arr[i][1] represents the ending time of the ith meeting, determine whether it is possible for a p...read more

article_image

Add minimum sized interval such that all intervals merge into one

Last Updated: 23 July 2025

Given a 2D array arr of size N which represents an interval [start, end] inclusive where (start end), the task is to add only one interval of minimum size (size = end - s...read more

Minimum number of intervals to cover the target interval

Last Updated: 23 July 2025

Given an array A[] consisting of N intervals and a target interval X, the task is to find the minimum number of intervals from the given array A[] such that they entirely ...read more

interview-preparation

Non-overlapping intervals in an array

Last Updated: 14 January 2026

Given a 2d array arr[][] of time intervals, where each interval is of the form [start, end]. The task is to determine all intervals from the given array that do not overla...read more

Non-Overlapping Intervals

Last Updated: 16 July 2026

Given a 2D array intervals[][], where intervals[i] = [starti, endi]. Find the minimum number of intervals need to be removed to make the rest of the intervals non-overlapp...read more

article_image

Maximum number of overlapping Intervals

Last Updated: 08 August 2025

Given an array of intervals arr[] where each interval is represented by two integers [start, end] (inclusive). Find the maximum number of intervals that overlap at any poi...read more

article_image

Check if any K ranges overlap at any point

Last Updated: 26 March 2025

Given N ranges [L, R] and an integer K, the task is to check if there are any K ranges that overlap at any point.Examples:Input: ranges[][] = {{1, 3}, {2, 4}, {3, 4}, {7, ...read more

Technical Scripter

Technical Scripter 2019

cpp-stack-functions

Maximal Disjoint Intervals

Last Updated: 11 July 2025

Given a 2D array arr[][] of order nx2, representing n intervals with start and end points, the task is to find the maximal set of mutually disjoint intervalsNote: Two inte...read more

Find Intersection of all Intervals

Last Updated: 26 March 2025

Given N intervals of the form of [l, r], the task is to find the intersection of all the intervals. An intersection is an interval that lies within all of the given interv...read more

Insert and Merge Interval

Last Updated: 07 August 2025

Given a set of non-overlapping intervals[][] where intervals[i] = [starti , endi] represent the start and the end of the ith event and intervals is sorted in ascending or...read more

article_image

Weighted Job Scheduling Memoization Solution in O(n Log n) time

Last Updated: 06 October 2025

Given n jobs where every job has the following properties:Start TimeFinish TimeProfit or Value AssociatedThe task is to find the maximum profit in scheduling jobs such tha...read more

Dynamic Programming

Find the point where maximum intervals overlap

Last Updated: 23 July 2025

Consider a big party where a log register for guest's entry and exit times is maintained. Find the time at which there are maximum guests in the party. Given the Entry(Ent...read more

Check if any two intervals intersect in a given set

Last Updated: 26 March 2025

An interval is represented as a combination of start time and end time. Given a set of intervals, check if any two intervals intersect.Examples:Input: arr[] = [[1, 3], [5...read more

Weighted Job Scheduling

Last Updated: 03 November 2025

Given a 2D array jobs[][] of size n × 3, where each row represents a single job with the following details:jobs[i][0] → Start time of the jobjobs[i][1] → End time of the j...read more

Dynamic Programming

1 2