For this Question: Given an array <b>A[]</b>, of length <b>N</b> containing zero , positive and negative integers. 
You need to find the length of the largest subarray whose sum of elements is <b>0</b>.The first line contains N denoting the size of the array A. Then in the next line contains N space-separated values of the array A.

<b>Constraints:-</b>
1 <= N <= 1e5
-1e6 <= A[i] <= 1e6Print the length of the largest subarray which has sum 0, If no subarray exist print -1.Sample Input:-
8
15 -2 2 -8 1 7 10 23

Sample Output:-
5

Explanation:-
-2 2 -8 1 7 is the required subarray

Sample Input:-
5
1 2 1 2 3

Sample Output:-
-1, I have written this Solution Code: def maxLen(arr,n,k): 
    mydict = dict() 
    sum = 0
    maxLen = 0
    for i in range(n): 
        sum += arr[i] 
        if (sum == k): 
            maxLen = i + 1
        elif (sum - k) in mydict: 
            maxLen = max(maxLen, i - mydict[sum - k]) 
        if sum not in mydict: 
            mydict[sum] = i 
    return maxLen
n=int(input())
arr=input().split()
for i in range(0,n):
    arr[i]=int(arr[i])
max_len=maxLen(arr,n,0)
if(max_len==0):
    print ("-1")
else:
    print (max_len), In this Programming Language: Python, Now tell me if this Code is compilable or not?