435. Non-overlapping Intervals | Leetcode | Medium | Java | Greedy Algorithm
This is a medium level problem on leetcode which can be solved using greedy algorithm.
It is similar to Merge Intervals, as we are required to find an interval to make rest of the intervals non-overlapping.
It was asked in JPMorgan in last six months.
You guys can also search questions with company tags on leetcode by adding a google chrome extension, for getting a link to this extension you can contact me on [email protected].
Link to the problem: https://leetcode.com/problems/non-ove...
Other problems for practice:
• Insert Interval | Leetcode | Medium | Java...
• 45. Jump Game II | Leetcode | Medium | Jav...
• 55. Jump Game | Leetcode | Medium | Java |...
• 678. Valid Parenthesis String | Leetcode |...
• 860. Lemonade Change | Leetcode | Easy | J...
• 455. Assign Cookies | Leetcode | Easy | Ja...
• 347. Top K Frequent Elements | Leetcode | ...
• 621. Task Scheduler | Leetcode | Medium | ...
• 846. Hand of Straights | Leetcode POTD 6 J...