Given a 1-based indexing array arr[] of non-negative integers and an integer sum. You mainly need to return the left and right indexes(1-based indexing) of that subarray. In case of multiple subarrays, return the subarray indexes which come first on moving from left to right. If no such subarray exists return an array consisting of element -1.
Examples:
Input: arr[] = [15, 2, 4, 8, 9, 5, 10, 23], target = 23
Output: [2, 5]
Explanation: Sum of subarray arr[2...5] is 2 + 4 + 8 + 9 = 23.
Input: arr[] = [1, 10, 4, 0, 3, 5], target = 7
Output: [3, 5]
Explanation: Sum of subarray arr[3...5] is 4 + 0 + 3 = 7.
Input: arr[] = [1, 4], target = 0
Output: [-1]
Explanation: There is no subarray with 0 sum.
[Naive Approach] Using Nested loop - O(n^2) Time and O(1) Space
The very basic idea is to use a nested loop where the outer loop picks a starting element, and the inner loop calculates the cumulative sum of elements starting from this element.
For each starting element, the inner loop iterates through subsequent elements and adding each element to the cumulative sum until the given sum is found or the end of the array is reached. If at any point the cumulative sum equals the given sum, then return starting and ending indices (1-based). If no such sub-array is found after all iterations, then return -1.
C++
#include <iostream>
#include <vector>
using namespace std;
// Function to find a continuous sub-array which adds up to
// a given number.
vector<int> subarraySum(vector<int> arr, int target) {
vector<int> res;
int n = arr.size();
// Pick a starting point for a subarray
for (int s = 0; s < n; s++) {
int curr = 0;
// Consider all ending points
// for the picked starting point
for (int e = s; e < n; e++) {
curr += arr[e];
if (curr == target) {
res.push_back(s + 1);
res.push_back(e + 1);
return res;
}
}
}
// If no subarray is found
return {-1};
}
int main() {
vector<int> arr = {15, 2, 4, 8, 9, 5, 10, 23};
int target = 23;
vector<int> res = subarraySum(arr, target);
for (int ele : res)
cout << ele << " ";
return 0;
}
import java.util.ArrayList;
import java.util.List;
class GfG {
// Function to find a continuous sub-array which adds up to
// a given number.
static ArrayList<Integer> subarraySum(int[] arr, int target) {
ArrayList<Integer> res = new ArrayList<>();
int n = arr.length;
// Pick a starting point for a subarray
for (int s = 0; s < n; s++) {
int curr = 0;
// Consider all ending points
// for the picked starting point
for (int e = s; e < n; e++) {
curr += arr[e];
if (curr == target) {
res.add(s + 1);
res.add(e + 1);
return res;
}
}
}
// If no subarray is found
res.add(-1);
return res;
}
public static void main(String[] args) {
int[] arr = {15, 2, 4, 8, 9, 5, 10, 23};
int target = 23;
ArrayList<Integer> res = subarraySum(arr, target);
for (int ele : res)
System.out.print(ele + " ");
}
}
# Function to find a continuous sub-array which adds up to
# a given number.
def subarraySum(arr, target):
res = []
n = len(arr)
# Pick a starting point for a subarray
for s in range(n):
curr = 0
# Consider all ending points
# for the picked starting point
for e in range(s, n):
curr += arr[e]
if curr == target:
res.append(s + 1)
res.append(e + 1)
return res
# If no subarray is found
return [-1]
if __name__ == "__main__":
arr = [15, 2, 4, 8, 9, 5, 10, 23]
target = 23
res = subarraySum(arr, target)
for ele in res:
print(ele, end=" ")
using System;
using System.Collections.Generic;
class GfG {
// Function to find a continuous sub-array which adds up to
// a given number.
static List<int> subarraySum(int[] arr, int target) {
List<int> res = new List<int>();
int n = arr.Length;
// Pick a starting point for a subarray
for (int s = 0; s < n; s++) {
int curr = 0;
// Consider all ending points
// for the picked starting point
for (int e = s; e < n; e++) {
curr += arr[e];
if (curr == target) {
res.Add(s + 1);
res.Add(e + 1);
return res;
}
}
}
// If no subarray is found
res.Add(-1);
return res;
}
static void Main() {
int[] arr = {15, 2, 4, 8, 9, 5, 10, 23};
int target = 23;
List<int> res = subarraySum(arr, target);
foreach (var ele in res)
Console.Write(ele + " ");
}
}
// Function to find a continuous sub-array which adds up to
// a given number.
function subarraySum(arr, target) {
let res = [];
let n = arr.length;
// Pick a starting point for a subarray
for (let s = 0; s < n; s++) {
let curr = 0;
// Consider all ending points
// for the picked starting point
for (let e = s; e < n; e++) {
curr += arr[e];
if (curr === target) {
res.push(s + 1);
res.push(e + 1);
return res;
}
}
}
// If no subarray is found
return [-1];
}
// Driver Code
let arr = [15, 2, 4, 8, 9, 5, 10, 23];
let target = 23;
let res = subarraySum(arr, target);
console.log(res.join(' '));
[Expected Approach] Sliding Window - O(n) Time and O(1) Space
The idea is simple, as we know that all the elements in subarray are positive so, If a subarray has sum greater than the given sum then there is no possibility that adding elements to the current subarray will be equal to the given sum. So the Idea is to use a similar approach to a sliding window.
- Start with an empty window
- add elements to the window while the current sum is less than sum
- If the sum is greater than sum, remove elements from the start of the current window.
- If current sum becomes same as sum, return the result
C++
#include <iostream>
#include <vector>
using namespace std;
// Function to find a continuous sub-array which adds up to
// a given number.
vector<int> subarraySum(vector<int>& arr, int target) {
// Initialize window
int s = 0, e = 0;
vector<int> res;
int curr = 0;
for (int i = 0; i < arr.size(); i++) {
curr += arr[i];
// If current sum becomes more or equal,
// set end and try adjusting start
if (curr >= target) {
e = i;
// While current sum is greater,
// remove starting elements of current window
while (curr > target && s < e) {
curr -= arr[s];
++s;
}
// If we found a subraay
if (curr == target) {
res.push_back(s + 1);
res.push_back(e + 1);
return res;
}
}
}
// If no subarray is found
return {-1};
}
int main() {
vector<int> arr = {15, 2, 4, 8, 9, 5, 10, 23};
int target = 23;
vector<int> res = subarraySum(arr, target);
for (int ele : res)
cout << ele << " ";
return 0;
}
import java.util.ArrayList;
import java.util.List;
class GfG {
// Function to find a continuous sub-array which adds up to
// a given number.
static ArrayList<Integer> subarraySum(int[] arr, int target) {
// Initialize window
int s = 0, e = 0;
ArrayList<Integer> res = new ArrayList<>();
int curr = 0;
for (int i = 0; i < arr.length; i++) {
curr += arr[i];
// If current sum becomes more or equal,
// set end and try adjusting start
if (curr >= target) {
e = i;
// While current sum is greater,
// remove starting elements of current window
while (curr > target && s < e) {
curr -= arr[s];
++s;
}
// If we found a subarray
if (curr == target) {
res.add(s + 1);
res.add(e + 1);
return res;
}
}
}
// If no subarray is found
res.add(-1);
return res;
}
public static void main(String[] args) {
int[] arr = {15, 2, 4, 8, 9, 5, 10, 23};
int target = 23;
ArrayList<Integer> res = subarraySum(arr, target);
for (int ele : res)
System.out.print(ele + " ");
}
}
# Function to find a continuous sub-array which adds up to
# a given number.
def subarraySum(arr, target):
# Initialize window
s, e = 0, 0
res = []
curr = 0
for i in range(len(arr)):
curr += arr[i]
# If current sum becomes more or equal,
# set end and try adjusting start
if curr >= target:
e = i
# While current sum is greater,
# remove starting elements of current window
while curr > target and s < e:
curr -= arr[s]
s += 1
# If we found a subarray
if curr == target:
res.append(s + 1)
res.append(e + 1)
return res
# If no subarray is found
return [-1]
if __name__ == "__main__":
arr = [15, 2, 4, 8, 9, 5, 10, 23]
target = 23
res = subarraySum(arr, target)
print(" ".join(map(str, res)))
using System;
using System.Collections.Generic;
class GfG {
// Function to find a continuous sub-array which adds up to
// a given number.
static List<int> subarraySum(int[] arr, int target) {
// Initialize window
int s = 0, e = 0;
List<int> res = new List<int>();
int curr = 0;
for (int i = 0; i < arr.Length; i++) {
curr += arr[i];
// If current sum becomes more or equal,
// set end and try adjusting start
if (curr >= target) {
e = i;
// While current sum is greater,
// remove starting elements of current window
while (curr > target && s < e) {
curr -= arr[s];
++s;
}
// If we found a subarray
if (curr == target) {
res.Add(s + 1);
res.Add(e + 1);
return res;
}
}
}
// If no subarray is found
res.Add(-1);
return res;
}
static void Main() {
int[] arr = {15, 2, 4, 8, 9, 5, 10, 23};
int target = 23;
List<int> res = subarraySum(arr, target);
foreach (var ele in res)
Console.Write(ele + " ");
}
}
// Function to find a continuous sub-array which adds up to
// a given number.
function subarraySum(arr, target) {
// Initialize window
let s = 0, e = 0;
let res = [];
let curr = 0;
for (let i = 0; i < arr.length; i++) {
curr += arr[i];
// If current sum becomes more or equal,
// set end and try adjusting start
if (curr >= target) {
e = i;
// While current sum is greater,
// remove starting elements of current window
while (curr > target && s < e) {
curr -= arr[s];
s++;
}
// If we found a subarray
if (curr === target) {
res.push(s + 1);
res.push(e + 1);
return res;
}
}
}
// If no subarray is found
return [-1];
}
// Driver Code
let arr = [15, 2, 4, 8, 9, 5, 10, 23];
let target = 23;
let res = subarraySum(arr, target);
console.log(res.join(' '));
[Alternate Approach] Hashing + Prefix Sum - O(n) Time and O(n) Space
The above solution does not work for arrays with negative numbers. To handle all cases, we use hashing and prefix sum. The idea is to store the sum of elements of every prefix of the array in a hashmap, i.e, every index stores the sum of elements up to that index hashmap. So to check if there is a subarray with a sum equal to target, check for every index i, and sum up to that index as currSum. If there is a prefix with a sum equal to (currSum – target), then the subarray with the given sum is found.
To know more about the implementation, please refer Subarray with Given Sum – Handles Negative Numbers.
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