Technical Interview.... Finding Subarray Suppose you work for a finance company and have been given a summation task that needs to be implemented optimally. You have an array of integers, and your task is to find the number of sub-arrays whose elements form a sum of zero. Two sub-arrays may be considered different if either their starting or ending index is different. Expected Time Complexity: O(n) Question 1 of 1 Input The first line of input contains an integer N, representing the size of the array. The second line of input contains N space-separated integers, representing the array elements. Output Print the total number of sub-arrays whose sum is 0. Constraints 1