Merge Intervals at Citadel

Medium51.1% acceptance

This problem has 87.5% frequency at Citadel.

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 Atlassian Autodesk Bloomberg ByteDance C3 AI Capital One Cars24 Chewy Cisco CleverTap Coupa Coupang+88 more

View Full Problem

Problem Description

Topics

Also asked at 108 companies

More Citadel Questions