##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Coordinate compression
Given an integer array nums and two integers lower and upper, return the number of range sums that lie in inclusive.
Range sum is the sum of elements from index to where . Example: nums , lower , upper . Range sums: .
In range: . Answer: . This you can solve with segment tree + coordinate compression on prefix sums. Constraints: up to elements, values up to .
