# Prefix Sum

- [1608. Special Array With X Elements Greater Than or Equal X](/cracking-leetcode/prefix-sum/1608.-special-array-with-x-elements-greater-than-or-equal-x.md)
- [(prefix product + siliding win)713. Subarray Product Less Than K](/cracking-leetcode/prefix-sum/prefix-product-+-siliding-win-713.-subarray-product-less-than-k.md)
- [930. Binary Subarrays With Sum](/cracking-leetcode/prefix-sum/930.-binary-subarrays-with-sum.md)
- [2256. Minimum Average Difference](/cracking-leetcode/prefix-sum/2256.-minimum-average-difference.md)
- [Page](/cracking-leetcode/prefix-sum/page.md)
- [303. Range Sum Query - Immutable](/cracking-leetcode/prefix-sum/303.-range-sum-query-immutable.md)
- [304. Range Sum Query 2D - Immutable](/cracking-leetcode/prefix-sum/304.-range-sum-query-2d-immutable.md)
- [560. Subarray Sum Equals K](/cracking-leetcode/prefix-sum/560.-subarray-sum-equals-k.md)
- [lintcode 1844 · subarray sum equals to k II](/cracking-leetcode/prefix-sum/lintcode-1844-subarray-sum-equals-to-k-ii.md)
- [325. Maximum Size Subarray Sum Equals k (can refer to lintcode 1844)](/cracking-leetcode/prefix-sum/325.-maximum-size-subarray-sum-equals-k-can-refer-to-lintcode-1844.md)
- [209. Minimum Size Subarray Sum](/cracking-leetcode/prefix-sum/209.-minimum-size-subarray-sum.md)
- [1477. Find Two Non-overlapping Sub-arrays Each With Target Sum](/cracking-leetcode/prefix-sum/1477.-find-two-non-overlapping-sub-arrays-each-with-target-sum.md)
- [525. Contiguous Array](/cracking-leetcode/prefix-sum/525.-contiguous-array.md)
- [Diff array (差分](/cracking-leetcode/prefix-sum/diff-array-cha-fen.md): 差分
- [370. Range Addition (差分](/cracking-leetcode/prefix-sum/diff-array-cha-fen/370.-range-addition-cha-fen.md)
- [1109. Corporate Flight Bookings (差分](/cracking-leetcode/prefix-sum/diff-array-cha-fen/1109.-corporate-flight-bookings-cha-fen.md)
- [1094. Car Pooling (差分](/cracking-leetcode/prefix-sum/diff-array-cha-fen/1094.-car-pooling-cha-fen.md)
- [995. Minimum Number of K Consecutive Bit Flips](/cracking-leetcode/prefix-sum/diff-array-cha-fen/995.-minimum-number-of-k-consecutive-bit-flips.md)
- [1685. Sum of Absolute Differences in a Sorted Array](/cracking-leetcode/prefix-sum/1685.-sum-of-absolute-differences-in-a-sorted-array.md)
- [(sum %= k) 523. Continuous Subarray Sum](/cracking-leetcode/prefix-sum/sum-k-523.-continuous-subarray-sum.md)
- [(sum %= k) 974. Subarray Sums Divisible by K](/cracking-leetcode/prefix-sum/sum-k-974.-subarray-sums-divisible-by-k.md)
- [(sum % p) 1590. Make Sum Divisible by P](/cracking-leetcode/prefix-sum/sum-p-1590.-make-sum-divisible-by-p.md)
- [2845. Count of Interesting Subarrays](/cracking-leetcode/prefix-sum/2845.-count-of-interesting-subarrays.md): based on 974. Subarray Sums Divisible by K
- [2155. All Divisions With the Highest Score of a Binary Array](/cracking-leetcode/prefix-sum/2155.-all-divisions-with-the-highest-score-of-a-binary-array.md)
- [2875. Minimum Size Subarray in Infinite Array](/cracking-leetcode/prefix-sum/2875.-minimum-size-subarray-in-infinite-array.md)