---
title: "#prefixsum articles | Hashnode"
description: "Explore 9 articles tagged #prefixsum on Hashnode. Tutorials, guides, and how-tos from the community."
url: "https://hashnode.com/tag/prefixsum"
---

Tag

# #prefixsum

9 posts · 0 followers

[Shubham Kumar Singh](https://hashnode.com/@shubhamsinghbundela) · [Apr 1](https://hashnode.com/posts/prefix-sum-array-technique/69ccf392b504c4ed0a6f96c3)

### [Prefix Sum Array Technique](https://shubhamsinghbundela.hashnode.dev/prefix-sum-array-technique?utm_source=hashnode&utm_medium=feed)

A complete beginner’s guide to Prefix Sum Array. Learn step-by-step with easy examples and code to solve array and subarray problems efficiently.

5 min read · [shubhamsinghbundela.hashnode.dev](https://shubhamsinghbundela.hashnode.dev/prefix-sum-array-technique?utm_source=hashnode&utm_medium=feed)

[Anurag Srivastava](https://hashnode.com/@Javenture) · [Mar 12, 2025](https://hashnode.com/posts/counting-subarrays-with-sum-equal-to-k-a-prefix-sum-approach-in-java/67d11401be5dae25a8d13f9e)

### [Counting Subarrays with Sum Equal to K: A Prefix Sum Approach in Java](https://javenture.hashnode.dev/counting-subarrays-with-sum-equal-to-k-a-prefix-sum-approach-in-java?utm_source=hashnode&utm_medium=feed)

Finding subarrays with a specific sum is a classic problem in computer science. In this blog post, we'll explore an efficient solution using the concept of prefix sums and a HashMap in Java. Understanding the Problem Given an array of integers num an...

4 min read · [javenture.hashnode.dev](https://javenture.hashnode.dev/counting-subarrays-with-sum-equal-to-k-a-prefix-sum-approach-in-java?utm_source=hashnode&utm_medium=feed)

[Jay Chouksey](https://hashnode.com/@jaychouksey) · [Jul 15, 2024](https://hashnode.com/posts/find-pivot-index/669508a944a95d5ee28c3d10)

### [Find Pivot Index](https://jayjava.hashnode.dev/find-pivot-index?utm_source=hashnode&utm_medium=feed)

A LeetCode 75 Challenge

3 min read · [jayjava.hashnode.dev](https://jayjava.hashnode.dev/find-pivot-index?utm_source=hashnode&utm_medium=feed)

[Sumit Mazumdar](https://hashnode.com/@sum1t-here) · [Sep 6, 2023](https://hashnode.com/posts/understanding-and-converting-mathematical-expressions-infix-postfix-and-prefix-notations/64f825d1abc9942ce6e9a3ba)

### [Understanding and Converting Mathematical Expressions: Infix, Postfix and Prefix Notations](https://sumitmazumdar.in/understanding-and-converting-mathematical-expressions-infix-postfix-and-prefix-notations?utm_source=hashnode&utm_medium=feed)

Infix Notation Infix is the day-to-day notation that we use of format A + B type. The general form can be classified as (a op b) where a and b are operands(variables) and op is the Operator. Example 1 : A + B Example 2 : A \* B + C / D Postfix Not...

15 min read · [sumitmazumdar.in](https://sumitmazumdar.in/understanding-and-converting-mathematical-expressions-infix-postfix-and-prefix-notations?utm_source=hashnode&utm_medium=feed)

[Akarsh Jain](https://hashnode.com/@akarshjain) · [Aug 29, 2023](https://hashnode.com/posts/the-prefix-sum-a-simple-but-efficient-data-structure/64ee2d33450f97ad03ab3af2)

### [The Prefix Sum: A Simple but Efficient Data Structure](https://akarshjain.hashnode.dev/the-prefix-sum-a-simple-but-efficient-data-structure?utm_source=hashnode&utm_medium=feed)

If you've started to venture into the world of programming, you might have come across situations where you need to work with parts of a list, even though you might not realize it just yet. No worries if this sounds new – I'm here to walk you through...

6 min read · [akarshjain.hashnode.dev](https://akarshjain.hashnode.dev/the-prefix-sum-a-simple-but-efficient-data-structure?utm_source=hashnode&utm_medium=feed)

[Nilesh Saini](https://hashnode.com/@Nile) · [May 30, 2023](https://hashnode.com/posts/find-pivot-index/64763e77deb8b4bf8d80282a)

### [Find Pivot Index](https://nileshsaini.hashnode.dev/find-pivot-index?utm_source=hashnode&utm_medium=feed)

Different approaches to solve Leetcode 724 in JavaScript

3 min read · [nileshsaini.hashnode.dev](https://nileshsaini.hashnode.dev/find-pivot-index?utm_source=hashnode&utm_medium=feed)

[Siddharth Tambat](https://hashnode.com/@Terminator97) · [May 1, 2023](https://hashnode.com/posts/the-magic-of-prefix-array-boosting-your-programming-skills/644f7a0d74157ab909adf73b)

### [The Magic of Prefix Array: Boosting Your Programming Skills](https://techtronic.hashnode.dev/the-magic-of-prefix-array-boosting-your-programming-skills?utm_source=hashnode&utm_medium=feed)

The Magic of Prefix Array: Boosting Your Programming Skills

6 min read · [techtronic.hashnode.dev](https://techtronic.hashnode.dev/the-magic-of-prefix-array-boosting-your-programming-skills?utm_source=hashnode&utm_medium=feed)

[1](https://hashnode.com/posts/the-magic-of-prefix-array-boosting-your-programming-skills/644f7a0d74157ab909adf73b)

[Rahul Saxena](https://hashnode.com/@raahulsaxena) · [Jun 18, 2022](https://hashnode.com/posts/leetcode-75-day-1-1480-running-sum-of-1d-array/62adc0480924134a80487893)

### [Leetcode 75: Day 1: 1480. Running Sum of 1d Array](https://raahulsaxena.hashnode.dev/leetcode-75-day-1-1480-running-sum-of-1d-array?utm_source=hashnode&utm_medium=feed)

Question Given an array nums. We define a running sum of an array as runningSum\[i\] = sum(nums\[0\]…nums\[i\]). Return the running sum of nums. Example 1: Input: nums = \[1,2,3,4\] Output: \[1,3,6,10\] Explanation: Running sum is obtained as follows: \[1, 1+2,...

1 min read · [raahulsaxena.hashnode.dev](https://raahulsaxena.hashnode.dev/leetcode-75-day-1-1480-running-sum-of-1d-array?utm_source=hashnode&utm_medium=feed)

[Rahul Saxena](https://hashnode.com/@raahulsaxena) · [Jun 18, 2022](https://hashnode.com/posts/leetcode-75-day-1-724-find-pivot-index/62adc829d8afe74aa51fac46)

### [Leetcode 75: Day 1: 724. Find Pivot Index](https://raahulsaxena.hashnode.dev/leetcode-75-day-1-724-find-pivot-index?utm_source=hashnode&utm_medium=feed)

Question: Given an array of integers nums, calculate the pivot index of this array. The pivot index is the index where the sum of all the numbers strictly to the left of the index is equal to the sum of all the numbers strictly to the index's right. ...

2 min read · [raahulsaxena.hashnode.dev](https://raahulsaxena.hashnode.dev/leetcode-75-day-1-724-find-pivot-index?utm_source=hashnode&utm_medium=feed)
