Intervals

The key of solving this problem is to sort the array first in ascending order based on the end value of each element because we want to get the overlapping part of each balloon. By sorting it this way, we… Read More »Leetcode 452 Minimum Number of Arrows to Burst Balloons

Initially, the interval we are trying to merge in is newInterval, as we loop through the array, it might change depending on the current interval’s start and end values. We either merge the 2 intervals , OR we move on… Read More »Leetcode 57 Insert Interval