Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.