Verify if each Subarray of even size has sum 0

Given an array A[ ] of measurement N, the duty is to verify if the sum of each even-sized subarray is 0 or not.

Examples:

Enter: N = 4, A[] = {8, -8, 7, 9}
Output: NO
Rationalization: Sum of subarray {7, 9} will not be 0.

Enter: N = 2, A[] = {0, 0}
Output: YES
Rationalization: The one doable even size subarray is {0, 0} and its sum is 0.

Naive Method: The fundamental strategy to resolve the issue is as follows:

Generate all doable even size subarrays and verify if sum is 0 or not and return “YES” or “NO” accordingly.

Time Complexity: O(N²)
Auxiliary House: O(1)

Environment friendly Method: To resolve the issue comply with the under thought:

The thought is to verify the whole array as soon as for all doable subarrays of size 2 as a result of all different evn sized subarrays of size higher than 2 could be made by combining subarrays of size 2. So if all subarrays of size 2 have sum 0, all different even sized subarrays will even have sum 0.

Observe the steps talked about under to implement the thought:

• Begin iterating from i = 1 to N-1:
  • Verify if the sum of A[i] and A[i-1] is 0 or not.
  • If it’s not 0, return the reply as “NO” and no must calculate additional.
• If the iteration is over and the situation is glad for all of the subarrays, return “YES” because the required reply.

Beneath is the implementation of the above strategy.

Time Complexity: O(N)
Auxiliary House: O(1)