[algogeeks] Sum of sub array

[Abhi]

Given sorted array of size n. For any i, j < n; return me sum from
array[i] to array[j] in O(log n). You can use O(n) memory, do
pre-computations and store it in a data structure

-Abhishikt