Sigmoid SDE Interview Question 2025 December | Greedy Algorithms (Intervals) | On-campus

Question 1: Minimum Number of Arrows to Burst Balloons Problem Statement There are some spherical balloons taped onto a flat wall. You are given a 2D integer array points where points[i] = [xstart, xend] denotes the horizontal diameter of a balloon. Arrows can be shot up vertically along the x-axis. A balloon is burst if an arrow is shot at x where xstart <= x <= xend. An arrow once shot keeps traveling up infinitely, bursting any balloons in its ...