NotificationsYou must be signed in to change notification settings
Fork5.8k
Star33.8k

feat: Add Basic Prefix Sum Algorithm with Tests (Fixes #1783)#1798

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to ourterms of service andprivacy statement. We’ll occasionally send you account related emails.

Already on GitHub?Sign in to your account

Jump to bottom

Open

Anshusinghh wants to merge1 commit intoTheAlgorithms:master

base:master

Choose a base branch

fromAnshusinghh:master

Open

feat: Add Basic Prefix Sum Algorithm with Tests (Fixes #1783)#1798

Anshusinghh wants to merge1 commit intoTheAlgorithms:masterfromAnshusinghh:master

Conversation

Copy link

Anshusinghh commentedSep 24, 2025

FIXES#1783

What does this PR do?

This PR adds an implementation of the Prefix Sum algorithm (in-place cumulative sum) in JavaScript.

Details

ImplementsprefixSum inPrefix-Sum/BasicPrefixSum.js
- Validates input (must be numeric array).
- ThrowsTypeError on invalid inputs.
- Modifies the array in-place and returns the same reference.
AddsPrefix-Sum/BasicPrefixSum.test.js with unit tests using Vitest.
- Covers integers, negatives, floats, empty input, and error handling.

Why is this needed?

Prefix sum is a fundamental algorithm widely used in competitive programming and data processing. Having an in-place implementation ensures O(1) extra space.