Merge Intervals at Atlassian

Medium51.1% acceptance

This problem has 75.0% frequency at Atlassian.

Problem Description

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_.

Read full problem and hints

Topics

Array Sorting

Also asked at 108 companies

Accenture Adobe Amazon AMD Anduril Apple Applied Intuition Athenahealth Autodesk Bloomberg ByteDance C3 AI Capital One Cars24 Chewy Cisco Citadel CleverTap Coupa Coupang+88 more

View Full Problem

Problem Description

Topics

Also asked at 108 companies

More Atlassian Questions