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.

[shivaganesht]

Excellent contribution! The Merge Intervals solution is well-implemented and addresses a classic interview problem effectively.

Strengths:

1. Clear type hints with list[list[int]] specification
2. Good documentation explaining the algorithm approach
3. Handles edge cases properly
4. Time complexity O(n log n) due to sorting is optimal

Code quality:

• Function signature is clear and type-safe
• Comments explain the merging logic well
• Variable names are descriptive

Suggestion: Consider adding a docstring with:n- Example usage

• Time and space complexity analysis
• Edge cases handled

This is a solid addition to the arrays collection!

[algorithms-keeper]

Click here to look at the relevant links ⬇️

🔗 Relevant Links

Repository:

• Contributing guidelines
• Project Euler solution guidelines

Python:

• Formatted string literals (f-strings)
• Type hints
• doctest
• unittest
• pytest

Automated review generated by algorithms-keeper. If there's any problem regarding this review, please open an issue about it.

---

algorithms-keeper commands and options

algorithms-keeper actions can be triggered by commenting on this PR:

• @algorithms-keeper review to trigger the checks for only added pull request files
• @algorithms-keeper review-all to trigger the checks for all the pull request files, including the modified files. As we cannot post review comments on lines not part of the diff, this command will post all the messages in one comment.

NOTE: Commands are in beta and so this feature is restricted only to a member or owner of the organization.

[algorithms-keeper]

An error occurred while parsing the file: data_structures/arrays/merge_intervals.py

Traceback (most recent call last):
  File "/opt/render/project/src/algorithms_keeper/parser/python_parser.py", line 146, in parse
    reports = lint_file(
              ^^^^^^^^^^
libcst._exceptions.ParserSyntaxError: Syntax Error @ 42:5.
parser error: error at 41:4: expected one of (, *, +, -, ..., AWAIT, DEDENT, False, NAME, NUMBER, None, True, [, break, continue, lambda, match, not, pass, ~

        return []
    ^

[gokul000410]

Excellent contribution! The Merge Intervals solution is well-implemented and addresses a classic interview problem effectively.

Strengths:

1. Clear type hints with list[list[int]] specification
2. Good documentation explaining the algorithm approach
3. Handles edge cases properly
4. Time complexity O(n log n) due to sorting is optimal

Code quality:

• Function signature is clear and type-safe
• Comments explain the merging logic well
• Variable names are descriptive

Suggestion: Consider adding a docstring with:n- Example usage

• Time and space complexity analysis
• Edge cases handled

This is a solid addition to the arrays collection!

Thank you for the suggestion! I have updated the merge_intervals function as follows:

• Added input validation to raise ValueError for invalid intervals (e.g., [[]])
• Handled edge cases: empty list, single interval, fully overlapping intervals
• Enhanced docstring with detailed explanation, examples, and time/space complexity

Please let me know if any further changes are needed.