Coding Interviews: Greedy Algorithms

Collapse

All Coding Interviews Simple Data Structures Searching and Sorting Arrays and Strings Stacks and Queues Greedy Algorithms Dynamic Programming Graphs Complex Data Structures Math Miscellaneous System Design

AllEasyMediumHardVideoPythonCode SolutionJavaJavascript

Merge overlapping intervals

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.

Greedy Algorithms Easy Video Code Solution Java