DIY: Find Interval Sets
Problem statement
You are given a list of intervals, and you have to organize them into sets such that only one interval can occupy a set at a time. Your job is to find the minimum number of sets we need to process all the intervals.
Input
The input is a list of lists. The nested lists contain two integers representing the starting and ending points of the ...
Create a free account to view this lesson.
By signing up, you agree to Educative's Terms of Service and Privacy Policy