Leetcode 699. Falling Squares

Given a sequence of squares specified by left coordinate and side length, simulate dropping them onto the x-axis where each square lands on top of any existing squares whose x-intervals overlap it, and return the height of the tallest stack after each drop. The core challenge is maintaining and updating interval maximum heights under range overlaps (commonly solved with coordinate compression plus segment tree/interval checks or efficient O(n^2) overlap scans).