Leetcode 327. Count of Range Sum

Count the number of subarray sums within [lower, upper] — equivalently, count pairs of prefix sums whose difference lies in [lower, upper]. With n up to 1e5 this requires better than O(n^2), typically solved using prefix sums plus a divide-and-conquer (merge sort) or a BIT/ordered set with coordinate compression.