Merge Intervals

The solution to Leetcode Medium Problem

Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.

Example 1:

Example 2:

Constraints:

I will be discussing here two approaches to solve this problem.

Time Complexity-O(n*n) + O(nlogn)

Space Complexity-O(n) in the worst case

The basic approach is :

Related posts:

Louise Meanwell is an alumnus of the Pace University, New York. She is a reliable professional who can be trusted in helping decide potentially life-changing financial decisions and investments. She…

Immutable X Coin post discusses a layer two NFT platform on Ethereum, it also talk about token price and market cap for better understanding of IMX crypto.

Now this may seem a little crazy at first on the initial once over of that statement BUT, there are glow-in-the-dark organisms all around us and before I delve into glowing plants, I want to whet…