DSA question set · 152 questions
Prefix Sum DSA Practice Questions
Explore 152 DSA questions in Prefix Sum. Practice with DSAWiser’s code editor and visualizer.
Prefix SumPrefix sumsPrefix countsPrefix / suffix sumsMultidimensional prefix sumsDifference arraysPrefix XORString range queriesDynamic programmingPrefix / suffix preprocessingBinary searchArithmetic sumsPrefix / suffix productsFrequency countingDynamic prefix sumsPoint updatesRange sumsOrdered prefix queriesMonotonic stacksPile prefix sumsHeapsRange updatesPersistent states
What’s in this set
The Prefix Sum collection contains 152 problems: 50 basic, 33 easy, 49 medium, 18 hard, 2 very hard. Choose a question at your current level, or follow the collection’s order below.
Topics in this collection include Prefix Sum, Prefix sums, Prefix counts, Prefix / suffix sums, Multidimensional prefix sums. Each question shows its own topics and difficulty so you can decide where to begin.
Practice with the code visualizer
- Open a question in the editor and read the statement, inputs, and expected output. Predict the result for a small example before writing code.
- Write a solution and run the examples. If a result differs from your prediction, reduce the input until you can follow each step.
- Step through your code in the visualizer. Use a breakpoint to inspect the state at a specific line, then compare it with your reasoning.
Questions in this set
152 totalOpen a question in the editor to read its statement and examples. Sign in to practice.
- Inclusive Prefix Sum ArrayPrefix Sum · Prefix sumsBasic
- Single-Element Array Prefix SumPrefix Sum · Prefix sumsBasic
- Two-Element Array Prefix SumPrefix Sum · Prefix sumsBasic
- Three-Element Array Prefix SumPrefix Sum · Prefix sumsBasic
- Running Sum of Array of Identical ElementsPrefix Sum · Prefix sumsBasic
- Prefix Sum Array with a Leading ZeroPrefix Sum · Prefix sumsBasic
- Leading-Zero Prefix Array for a Single ElementPrefix Sum · Prefix sumsBasic
- Leading-Zero Prefix Array for a Non-Empty ArrayPrefix Sum · Prefix sumsBasic
- Add a Leading Zero to a Prefix Sum ArrayPrefix Sum · Prefix sumsBasic
- Remove the Leading Zero from a Prefix Sum ArrayPrefix Sum · Prefix sumsBasic
- Reconstruct Original Array from 0-Indexed Prefix Sum ArrayPrefix Sum · Prefix sumsBasic
- Reconstruct an Array from a Leading-Zero Prefix ArrayPrefix Sum · Prefix sumsBasic
- Validate Whether an Array is a Valid Prefix Sum of Non-Negative NumbersPrefix Sum · Prefix sumsBasic
- Validate Whether an Array is a Valid Prefix Sum of Strictly Positive NumbersPrefix Sum · Prefix sumsBasic
- Check if the Final Element Equals Total Array SumPrefix Sum · Prefix sumsBasic
- Single Range Sum from Index 0 to R using 0-Indexed Prefix SumPrefix Sum · Prefix sumsBasic
- Single Range Sum [L, R] using 0-Indexed Prefix SumPrefix Sum · Prefix sumsBasic
- Single Range Sum Using a Leading-Zero Prefix ArrayPrefix Sum · Prefix sumsBasic
- Single Element Range Sum [i, i] using Prefix Sum ArrayPrefix Sum · Prefix sumsBasic
- Total Array Sum Query via 0-Indexed Prefix SumPrefix Sum · Prefix sumsBasic
- Batch Range Sum Queries on 0-Indexed Prefix Sum ArrayPrefix Sum · Prefix sumsBasic
- Range Sum Query with 1-Based Query IndicesPrefix Sum · Prefix sumsBasic
- Prefix Count of Elements Greater Than a ThresholdPrefix Sum · Prefix counts · Prefix sumsBasic
- Check if Range Sum [L, R] is Positive, Negative, or ZeroPrefix Sum · Prefix sumsBasic
- Check if Subarray Sum [L, R] is Even or Odd using Prefix SumsPrefix Sum · Prefix sumsBasic
- Prefix Count of Zeros in ArrayPrefix Sum · Prefix counts · Prefix sumsBasic
- Prefix Count of Even NumbersPrefix Sum · Prefix counts · Prefix sumsBasic
- Prefix Count of Negative NumbersPrefix Sum · Prefix counts · Prefix sumsBasic
- Prefix Count of Target Element KPrefix Sum · Prefix counts · Prefix sumsBasic
- Range Count of Target Element K via Prefix Count ArrayPrefix Sum · Prefix counts · Prefix sumsBasic
- Basic Suffix Sum of 0-Indexed ArrayPrefix Sum · Prefix / suffix sumsBasic
- Single-Element Suffix Sum ArrayPrefix Sum · Prefix / suffix sumsBasic
- Suffix Sum Array via Reverse TraversalPrefix Sum · Prefix / suffix sumsBasic
- Check a Candidate Prefix/Suffix Sum Identity at an IndexPrefix Sum · Prefix / suffix sumsBasic
- Query Suffix Range Sum [L, N-1] using Prefix Sum ArrayPrefix Sum · Prefix / suffix sumsBasic
- Check if a Given Index i is an Equilibrium IndexPrefix Sum · Prefix / suffix sumsBasic
- Check Equal Split Point at Given IndexPrefix Sum · Prefix sumsBasic
- Find First Index where Prefix Sum Reaches or Exceeds TargetPrefix Sum · Prefix sumsBasic
- Maximum Prefix Sum in an ArrayPrefix Sum · Prefix sumsBasic
- Minimum Prefix Sum in an ArrayPrefix Sum · Prefix sumsBasic
- 2D Prefix Sum of 1x1 GridPrefix Sum · Multidimensional prefix sumsBasic
- 2D Prefix Sum of Single-Row MatrixPrefix Sum · Multidimensional prefix sumsBasic
- 2D Prefix Sum of Single-Column MatrixPrefix Sum · Multidimensional prefix sumsBasic
- 2D Prefix Sum of 2x2 MatrixPrefix Sum · Multidimensional prefix sumsBasic
- Subgrid Sum Using a Padded 2D Prefix MatrixPrefix Sum · Multidimensional prefix sumsBasic
- Difference Array of a Given ArrayPrefix Sum · Difference arrays · Prefix sumsBasic
- Prefix Sum of Difference ArrayPrefix Sum · Difference arrays · Prefix sumsBasic
- Single Range Addition via Difference Array MarkingPrefix Sum · Difference arrays · Prefix sumsBasic
- Prefix XOR ArrayPrefix Sum · Prefix XORBasic
- Range XOR Query using Prefix XOR ArrayPrefix Sum · Prefix XORBasic
- Find the Highest AltitudePrefix Sum · Prefix sumsEasy
- Minimum Value to Get Positive Step-by-Step SumPrefix Sum · Prefix sumsEasy
- Ant on the BoundaryPrefix Sum · Prefix sumsEasy
- Left and Right Sum DifferencesPrefix Sum · Prefix sumsEasy
- Find Pivot IndexPrefix Sum · Prefix / suffix sumsEasy
- Number of Ways to Split Array into Two Equal Sum SubarraysPrefix Sum · Prefix sumsEasy
- Number of Ways to Split Array Where Left Sum Greater Than or Equal Right SumPrefix Sum · Prefix sumsEasy
- Maximum Score After Splitting a StringPrefix Sum · Prefix sumsEasy
- Count Partitions with Even Sum DifferencePrefix Sum · Prefix counts · Prefix sumsEasy
- Batch Range Sum Queries on an Immutable ArrayPrefix Sum · Prefix sumsEasy
- Sum of All Odd Length SubarraysPrefix Sum · Prefix sumsEasy
- Count Vowel Strings in RangesPrefix Sum · Prefix counts · Prefix sumsEasy
- Range Count of Even Numbers in QueriesPrefix Sum · Prefix counts · Prefix sumsEasy
- Check if Subarray Sum Between Indices [L, R] Exceeds ThresholdPrefix Sum · Prefix sumsEasy
- Find the Distinct Difference ArrayPrefix Sum · Difference arrays · Prefix sumsEasy
- Maximum Population YearPrefix Sum · Prefix sumsEasy
- Check if Any Point Overlaps in Interval SystemPrefix Sum · Prefix sumsEasy
- Points That Intersect With CarsPrefix Sum · Prefix sumsEasy
- Check if Subarray with Sum Zero ExistsPrefix Sum · Prefix sumsEasy
- Find Subarrays With Equal SumPrefix Sum · Prefix sumsEasy
- Count Subarrays with Even SumPrefix Sum · Prefix counts · Prefix sumsEasy
- Longest Subsequence With Limited SumPrefix Sum · Prefix sumsEasy
- Partition Array Into Three Parts With Equal SumPrefix Sum · Prefix sumsEasy
- Defuse the BombPrefix Sum · Prefix sumsEasy
- Find the Original Array of Prefix XORPrefix Sum · Prefix XOREasy
- Check if Any Subarray XOR Equals ZeroPrefix Sum · Prefix XOREasy
- Check if All Rows Have Equal Prefix Sum at Column KPrefix Sum · Prefix sumsEasy
- Row-wise vs Column-wise Prefix Sum of a GridPrefix Sum · Multidimensional prefix sumsEasy
- Submatrix Sum of Top-Left to (R, C) for Multiple PointsPrefix Sum · Multidimensional prefix sumsEasy
- Maximum Sum Subarray of Fixed Size K via Prefix SumPrefix Sum · Prefix sumsEasy
- Character Frequency Queries on SubstringsPrefix Sum · Prefix counts · String range queriesEasy
- Exclusive Prefix Scan and Total SumPrefix Sum · Prefix sumsEasy
- Exact Match and Lower Bound in Positive Prefix SumsPrefix Sum · Prefix sumsEasy
- Subarray Sum Equals KPrefix Sum · Prefix sumsMedium
- Maximum Size Subarray Sum Equals KPrefix Sum · Prefix sumsMedium
- Continuous Subarray SumPrefix Sum · Prefix sumsMedium
- Contiguous Array with Maximum LengthPrefix Sum · Prefix sumsMedium
- Subarray Sums Divisible by K with Negative Modulo HandlingPrefix Sum · Prefix sumsMedium
- Binary Subarrays With SumPrefix Sum · Prefix sumsMedium
- Count Number of Nice SubarraysPrefix Sum · Prefix counts · Prefix sumsMedium
- Longest Well-Performing IntervalPrefix Sum · Prefix sumsMedium
- Make Sum Divisible by PPrefix Sum · Prefix sumsMedium
- Find Two Non-overlapping Subarrays Each With Target SumPrefix Sum · Prefix sumsMedium
- Maximum Sum Circular SubarrayPrefix Sum · Dynamic programming · Prefix / suffix preprocessingMedium
- Maximum Subarray Sum with One DeletionPrefix Sum · Dynamic programming · Prefix / suffix preprocessingMedium
- Minimum Operations to Reduce X to ZeroPrefix Sum · Prefix sumsMedium
- Plates Between CandlesPrefix Sum · Prefix counts · Prefix sumsMedium
- Number of Ways to Select BuildingsPrefix Sum · Prefix sumsMedium
- Minimum Size Subarray Sum with Target SPrefix Sum · Prefix sumsMedium
- Ways to Split Array Into Three SubarraysPrefix Sum · Prefix sumsMedium
- Maximum Value at a Given Index in a Bounded ArrayPrefix Sum · Binary search · Arithmetic sumsMedium
- Count Subarrays With Median KPrefix Sum · Prefix counts · Prefix sumsMedium
- Max Consecutive Ones III via Prefix Sum of ZerosPrefix Sum · Prefix sumsMedium
- Car PoolingPrefix Sum · Difference arrays · Prefix sumsMedium
- Describe the PaintingPrefix Sum · Difference arrays · Prefix sumsMedium
- Minimum Number of Increments on Subarrays to Form a Target ArrayPrefix Sum · Prefix sumsMedium
- Check if Array is Good After Range DecrementsPrefix Sum · Difference arrays · Prefix sumsMedium
- Shifting Letters IIPrefix Sum · Prefix sumsMedium
- Count Submatrices with All OnesPrefix Sum · Multidimensional prefix sumsMedium
- Find the Longest Substring Containing Vowels in Even CountsPrefix Sum · Prefix counts · Prefix sumsMedium
- Count Triplets That Can Form Two Arrays of Equal XORPrefix Sum · Prefix XORMedium
- Minimum Average DifferencePrefix Sum · Prefix sumsMedium
- Product of Array Except SelfPrefix Sum · Prefix / suffix productsMedium
- Sum of Absolute Differences in a Sorted ArrayPrefix Sum · Prefix sumsMedium
- Shifting Letters using Suffix Sum of ShiftsPrefix Sum · Prefix / suffix sumsMedium
- Range Addition on 1D ArrayPrefix Sum · Difference arrays · Prefix sumsMedium
- Corporate Flight BookingsPrefix Sum · Difference arrays · Prefix sumsMedium
- Find the Student that Will Replace the ChalkPrefix Sum · Prefix sumsMedium
- Count Subarrays Where Number of 1s Equals Number of 0sPrefix Sum · Prefix counts · Prefix sumsMedium
- Count Subarrays with Sum Equal to Subarray LengthPrefix Sum · Prefix counts · Prefix sumsMedium
- XOR Queries of a SubarrayPrefix Sum · Prefix XORMedium
- Number of Subarrays with Odd SumPrefix Sum · Prefix sumsMedium
- Range Sum Query 2D - ImmutablePrefix Sum · Multidimensional prefix sumsMedium
- Matrix Block SumPrefix Sum · Multidimensional prefix sumsMedium
- Minimum Penalty for a ShopPrefix Sum · Prefix sumsMedium
- Count Beautiful Substrings IPrefix Sum · Prefix counts · Prefix sumsMedium
- Range Add Operations on 2D MatrixPrefix Sum · Difference arrays · Prefix sumsMedium
- Maximum White Tiles Covered by a CarpetPrefix Sum · Prefix sumsMedium
- Count Subarrays with XOR Equal to KPrefix Sum · Prefix XOR · Frequency countingMedium
- Dynamic Point Assignment and Range Sum QueriesPrefix Sum · Dynamic prefix sums · Point updates · Range sumsMedium
- Interleaved Range Addition and Point QueriesPrefix Sum · Difference arrays · Dynamic prefix sumsMedium
- Block Prefix Scan with Carry PropagationPrefix Sum · Prefix sumsMedium
- Shortest Subarray with Sum at Least KPrefix Sum · Prefix sums · Ordered prefix queriesHard
- Count of Range SumPrefix Sum · Prefix sums · Ordered prefix queriesHard
- Maximum Sum of 3 Non-Overlapping SubarraysPrefix Sum · Prefix sumsHard
- Split Array Largest SumPrefix Sum · Prefix sumsHard
- Max Sum of Rectangle No Larger Than KPrefix Sum · Prefix sumsHard
- Kth Smallest Subarray SumPrefix Sum · Prefix sumsHard
- Maximum Achievable Frequency After Bounded AdjustmentsPrefix Sum · Prefix sumsHard
- Beautiful Towers IIPrefix Sum · Monotonic stacks · Prefix / suffix preprocessingHard
- Maximum Value of K Coins From PilesPrefix Sum · Dynamic programming · Pile prefix sumsHard
- Minimum Cost to Split an ArrayPrefix Sum · Dynamic programming · Prefix / suffix preprocessingHard
- Minimum Difference in Sums After Removal of ElementsPrefix Sum · Heaps · Prefix / suffix preprocessingHard
- Count Subarrays With More Ones Than ZerosPrefix Sum · Prefix sums · Ordered prefix queriesHard
- Maximum Total Sum of Three Fixed-Length Windows with Negative ValuesPrefix Sum · Prefix sumsHard
- Number of Submatrices That Sum to TargetPrefix Sum · Multidimensional prefix sumsHard
- Maximum Submatrix Sum in Matrix with Row Prefix SumsPrefix Sum · Multidimensional prefix sumsHard
- Interleaved Range Addition and Range Sum QueriesPrefix Sum · Dynamic prefix sums · Range updates · Range sumsHard
- Streaming Range Sums with Persistent SnapshotsPrefix Sum · Persistent states · Range sumsHard
- Dynamic 3D Point Assignment and Cuboid SumsPrefix Sum · Multidimensional prefix sumsHard
- Fully Persistent Dynamic Prefix Sum Structure with Version BranchingPrefix Sum · Persistent states · Range sumsVery hard
- Dynamic 2D Range Add and 2D Range Sum Query StructurePrefix Sum · Difference arrays · Prefix sumsVery hard