Problem - Range Sum Query

Given an array of integers $nums$, handle multiple queries asking for the sum of elements between indices $i$ and $j$ (inclusive).

For example, if $nums = [-2, 0, 3, -5, 2, -1]$ and you query range $[0, 2]$, the answer is $-2 + 0 + 3 = 1$.

You could loop through the range each time, but that takes $O(n)$ per query. Can you precompute something to answer in $O(1)$?