Leetcode 3161. Block Placement Queries

Support inserting obstacles at points on the nonnegative number line and, for each query, determine whether there exists any obstacle-free interval of length >= sz fully inside [0, x] (touching obstacles is allowed). Algorithmically this reduces to maintaining an ordered set of obstacle positions and checking if the maximum consecutive gap within [0, x] is at least sz.