Suffix Sum ArrayGiven an array arr[] of size N, the task is to compute and return its suffix sum array.
Suffix Sum is a precomputation technique in which the sum of all the elements of the original array from an index i till the end of the array is computed.
Therefore, this suffix sum array will be created using the relation:
suffixSum[i] = arr[i] + arr[i+1] + arr[i+2] … +arr[n-1]
Examples:
Input: arr[] = { 15, 10, 25, 5, 10, 20 } , N = 6
Output: suffixSum[] = { 85, 70, 60, 35, 30, 20}
Explanation: While traversing the array from back, keep adding element from the back with element at current index.
suffixSum[5] = 20,
suffixSum[4] =suffixSum[5] + arr[4] = 20+10 = 30 ,
suffixSum[3] = suffixSum[4] + arr[3] = 30+5 = 35 and so on.
Input: arr[] = {10, 14, 16, 20}, n = 6
Output: suffixSum[] = {60, 50, 36, 20}
Explanation: suffixSum[3] = 20,
suffixSum[2] =suffixSum[3] + arr[2] = 20+16 = 36 ,
suffixSum[1] = suffixSum[2] + arr[1] = 36+14 = 40 and so on.
Naive Approach:
The naive approach to solve the problem is to traverse each element of the array and for each element calculate the sum of remaining elements to its right including itself using another loop.
Algorithm:
- Initialize an empty result vector suffixSum of size N with all elements as 0.
- Traverse the array arr[] from left to right using a for loop.
- For each i-th element in arr[], initialize a variable sum to 0.
- Traverse the subarray arr[i:N] from i-th index to N-th index using another for loop.
- For each j-th element in the subarray arr[i:N], add the value of arr[j] to the variable sum.
- After the inner loop is completed, set the i-th index of suffixSum vector as the value of sum.
- Continue the outer loop until all elements of arr[] have been traversed.
- The suffixSum vector now contains the suffix sum array for the input array arr[].
- Return the suffixSum vector.
Below is the implementation of the approach:
C++
// C++ code for the approach
#include<bits/stdc++.h>
using namespace std;
// Driver's code
int main() {
vector<int> arr = { 10, 14, 16, 20 };
int n = arr.size();
// initialize the suffix sum array with all elements as 0
vector<int> suffixSum(n, 0);
for(int i=0; i<n; i++) {
// calculate the sum of remaining elements to the right
for(int j=i; j<n; j++) {
suffixSum[i] += arr[j];
}
}
// Printing the computed suffix sum array
cout << "Suffix sum array: ";
for(int i=0; i<suffixSum.size(); i++) {
cout << suffixSum[i] << " ";
}
return 0;
}
import java.util.ArrayList;
import java.util.List;
public class SuffixSumArray {
public static void main(String[] args) {
List<Integer> arr = List.of(10, 14, 16, 20);
int n = arr.size();
// Initialize the suffix sum array with all elements as 0
List<Integer> suffixSum = new ArrayList<>(n);
for (int i = 0; i < n; i++) {
suffixSum.add(0);
}
for (int i = 0; i < n; i++) {
// Calculate the sum of remaining elements to the right
for (int j = i; j < n; j++) {
suffixSum.set(i, suffixSum.get(i) + arr.get(j));
}
}
// Printing the computed suffix sum array
System.out.print("Suffix sum array: ");
for (int i = 0; i < suffixSum.size(); i++) {
System.out.print(suffixSum.get(i) + " ");
}
}
}
arr = [10, 14, 16, 20]
n = len(arr)
# Initialize the suffix sum array with all elements as 0
suffix_sum = [0] * n
for i in range(n):
# Calculate the sum of remaining elements to the right
for j in range(i, n):
suffix_sum[i] += arr[j]
# Printing the computed suffix sum array
print("Suffix sum array:", suffix_sum)
using System;
using System.Collections.Generic;
class Program
{
static void Main()
{
List<int> arr = new List<int> { 10, 14, 16, 20 };
int n = arr.Count;
// Initialize the suffix sum array with all elements as 0
List<int> suffixSum = new List<int>(new int[n]);
for (int i = 0; i < n; i++)
{
// Calculate the sum of remaining elements to the right
for (int j = i; j < n; j++)
{
suffixSum[i] += arr[j];
}
}
// Printing the computed suffix sum array
Console.Write("Suffix sum array: ");
foreach (int sum in suffixSum)
{
Console.Write(sum + " ");
}
Console.WriteLine();
}
}
// Function to compute the suffix sum array
function computeSuffixSum(arr) {
const n = arr.length;
const suffixSum = new Array(n).fill(0);
for (let i = 0; i < n; i++) {
// Calculate the sum of remaining elements to the right
for (let j = i; j < n; j++) {
suffixSum[i] += arr[j];
}
}
return suffixSum;
}
// Main driver function
function main() {
const arr = [10, 14, 16, 20];
// Compute the suffix sum array
const suffixSum = computeSuffixSum(arr);
// Printing the computed suffix sum array
console.log("Suffix sum array:", suffixSum.join(" "));
}
// Call the main function
main();
OutputSuffix sum array: 60 50 36 20
Time Complexity: O(n*n) where n is size of input array. This is because two nested loops are executing.
Auxiliary Space: O(N), to store the suffix sum array.
Approach: To fill the suffix sum array, we run through index N-1 to 0 and keep on adding the current element with the previous value in the suffix sum array.
- Create an array of size N to store the suffix sum.
- Initialize the last element of the suffix sum array with the last element of the original array
suffixSum[n-1] = arr[n-1] - Traverse the original array from N-2 to 0
- For each index i find the suffix sum and store it at suffixSum[i]
- suffixSum[i] = suffixSum[i + 1] + arr[i]
- Return the computed suffix sum array.
Below is the implementation of the above approach to create a suffix sum array:
C++
// C++ program for Implementing
// suffix sum array
#include <bits/stdc++.h>
using namespace std;
// Function to create suffix sum array
vector<int> createSuffixSum(vector<int> arr, int n)
{
// Create an array to store the suffix sum
vector<int> suffixSum(n, 0);
// Initialize the last element of
// suffix sum array with last element
// of original array
suffixSum[n - 1] = arr[n - 1];
// Traverse the array from n-2 to 0
for (int i = n - 2; i >= 0; i--)
// Adding current element
// with previous element from back
suffixSum[i] = suffixSum[i + 1] + arr[i];
// Return the computed suffixSum array
return suffixSum;
}
// Driver Code
int main()
{
vector<int> arr = { 10, 14, 16, 20 };
int N = arr.size();
// Function call to fill suffix sum array
vector<int> suffixSum = createSuffixSum(arr, N);
// Printing the computed suffix sum array
cout << "Suffix sum array: ";
for (int i = 0; i < N; i++)
cout << suffixSum[i] << " ";
}
// Java program for Implementing
// suffix sum array
import java.util.*;
public class GFG {
// Function to create suffix sum array
static int[] createSuffixSum(int[] arr, int n)
{
// Create an array to store the suffix sum
int[] suffixSum = new int[n];
for (int i = 0; i < n; i++) {
suffixSum[i] = 0;
}
// Initialize the last element of
// suffix sum array with last element
// of original array
suffixSum[n - 1] = arr[n - 1];
// Traverse the array from n-2 to 0
for (int i = n - 2; i >= 0; i--)
// Adding current element
// with previous element from back
suffixSum[i] = suffixSum[i + 1] + arr[i];
// Return the computed suffixSum array
return suffixSum;
}
// Driver Code
public static void main(String args[])
{
int[] arr = { 10, 14, 16, 20 };
int N = arr.length;
// Function call to fill suffix sum array
int[] suffixSum = createSuffixSum(arr, N);
// Printing the computed suffix sum array
System.out.print("Suffix sum array: ");
for (int i = 0; i < N; i++)
System.out.print(suffixSum[i] + " ");
}
}
// This code is contributed by Samim Hossain Mondal.
# python3 program for Implementing
# suffix sum array
# Function to create suffix sum array
def createSuffixSum(arr, n):
# Create an array to store the suffix sum
suffixSum = [0 for _ in range(n)]
# Initialize the last element of
# suffix sum array with last element
# of original array
suffixSum[n - 1] = arr[n - 1]
# Traverse the array from n-2 to 0
for i in range(n-2, -1, -1):
# Adding current element
# with previous element from back
suffixSum[i] = suffixSum[i + 1] + arr[i]
# Return the computed suffixSum array
return suffixSum
# Driver Code
if __name__ == "__main__":
arr = [10, 14, 16, 20]
N = len(arr)
# Function call to fill suffix sum array
suffixSum = createSuffixSum(arr, N)
# Printing the computed suffix sum array
print("Suffix sum array: ", end="")
for i in range(0, N):
print(suffixSum[i], end=" ")
# This code is contributed by rakeshsahni
// C# program for Implementing
// suffix sum array
using System;
class GFG {
// Function to create suffix sum array
static int[] createSuffixSum(int[] arr, int n)
{
// Create an array to store the suffix sum
int[] suffixSum = new int[n];
for (int i = 0; i < n; i++) {
suffixSum[i] = 0;
}
// Initialize the last element of
// suffix sum array with last element
// of original array
suffixSum[n - 1] = arr[n - 1];
// Traverse the array from n-2 to 0
for (int i = n - 2; i >= 0; i--)
// Adding current element
// with previous element from back
suffixSum[i] = suffixSum[i + 1] + arr[i];
// Return the computed suffixSum array
return suffixSum;
}
// Driver Code
public static void Main()
{
int[] arr = { 10, 14, 16, 20 };
int N = arr.Length;
// Function call to fill suffix sum array
int[] suffixSum = createSuffixSum(arr, N);
// Printing the computed suffix sum array
Console.Write("Suffix sum array: ");
for (int i = 0; i < N; i++)
Console.Write(suffixSum[i] + " ");
}
}
// This code is contributed by Samim Hossain Mondal.
<script>
// JavaScript code for the above approach
// Function to create suffix sum array
function createSuffixSum(arr, n)
{
// Create an array to store the suffix sum
let suffixSum = new Array(n).fill(0);
// Initialize the last element of
// suffix sum array with last element
// of original array
suffixSum[n - 1] = arr[n - 1];
// Traverse the array from n-2 to 0
for (let i = n - 2; i >= 0; i--)
// Adding current element
// with previous element from back
suffixSum[i] = suffixSum[i + 1] + arr[i];
// Return the computed suffixSum array
return suffixSum;
}
// Driver Code
let arr = [10, 14, 16, 20];
let N = arr.length;
// Function call to fill suffix sum array
let suffixSum = createSuffixSum(arr, N);
// Printing the computed suffix sum array
document.write("Suffix sum array: ")
for (let i = 0; i < N; i++)
document.write(suffixSum[i] + " ");
// This code is contributed by Potta Lokesh
</script>
OutputSuffix sum array: 60 50 36 20
Time Complexity: O(N), to traverse the original array for computing suffix sum.
Auxiliary Space: O(N), to store the suffix sum array.
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem