In this post, we are going to solve a problem merge overlapping intervals.
Given a list of time intervals. Each interval has a start and end time. Write a code to merge all overlapping intervals. The given intervals may or may not be sorted.
For example –
Example 1-
Input: [[1,4], [2,5], [6,9]] Output: [[1,5], [6,9]]
Example 2-
Input: [[7,8], [2,3], [5,9]] Output: [[2,3], [5,9]]
Example 3-
Input: [[1,4], [2,6], [3,5]] Output: [[1,6]]
In this tutorial, I am going to discuss a very interesting problem find minimum in rotated sorted array.
Given an array which is sorted in ascending order is rotated at some unknown point. Write a code to find the minimum element in a sorted and rotated array.
You may assume no duplicate exists in the array.
For example:
Example 1:
Input: [6, 7, 8, 1, 2]
Output: 1
The minimum element in this sorted and rotated array is 1.
Example 2:
Input: [8, 9, 10, 1, 0, 1, 2]
Output: 0
In this example, the minimum element is 0.