Challenge: A Subarray with a Sum of 0
In this exercise, we will find a subarray whose sum turns out to be zero. Let's try it out.
We'll cover the following
Problem Statement #
You must implement the bool findSubZero(int* arr, int size)
function, which will take in an array of positive and negative integers. It will tell us if there exists a subarray in which the sum of all elements is zero. The term subarray implies that the elements whose sum is 0
must occur consecutively.
An array with these contents would return true
:
{6, 4, -7, 3, 12, 9}
Whereas this would return false
as the elements which sum up to be 0
do not appear together:
{-7, 4, 6, 3, 12, 9}
Input #
An array containing positive and negative integers and its size.
Output #
Returns true
if there exists a subarray with its sum equal to 0
. Otherwise, the function returns false
.
Sample Input #
arr = {6, 4, -7, 3, 12, 9}
size = 6
Sample Output #
true
Level up your interview prep. Join Educative to access 70+ hands-on prep courses.