Leetcode 452. Minimum Number of Arrows to Burst Balloons

Given a list of intervals [x_start, x_end] (endpoints inclusive), find the minimum number of points on the x-axis (vertical arrows) such that each interval contains at least one point. This is the classic interval-stabbing/covering problem: choose the fewest x positions that hit all intervals.