Opening page…
Precomputing running totals so any range sum is a subtraction, often paired with a hash map.
Solved
| Solved | # | Problem | Pattern | Level | Preview |
|---|---|---|---|---|---|
| 1 | Find Pivot Index | running sum | Easy | ||
| 2 | Range Sum Query - Immutable | prefix array · design | Easy | ||
| 3 | Subarray Sum Equals K | prefix sum + hash map | Medium | ||
| 4 | Continuous Subarray Sum | prefix sum + hash map · modular arithmetic | Medium | ||
| 5 | Subarray Sums Divisible by K | prefix sum + hash map · modular arithmetic | Medium | ||
| 6 | Number of Submatrices That Sum to Target | 2D prefix sum · prefix sum + hash map | Hard |
Showing 1–6 of 6 problems