added merge interval problem on the array data structure

[gokul000410]

This project/file contains a solution to the Merge Intervals problem, a common coding interview problem.

Problem Statement: Given a collection of intervals, merge all overlapping intervals and return a list of non-overlapping intervals that cover all the intervals in the input.

Example:

Input: [[1,3],[2,6],[8,10],[15,18]] Output: [[1,6],[8,10],[15,18]]

Key Points:

Handles overlapping intervals efficiently.

Time Complexity: O(n log n) due to sorting.

Space Complexity: O(n) for storing the merged intervals.

Usage:

The solution can be directly tested with custom interval inputs.

Ideal for practice in coding interviews and algorithm learning.