Balanced Subarray Sum

You are given an array of integers. Your task is to determine the length of the longest contiguous subarray where the sum of the elements is equal to zero. If no such subarray exists, return 0. Input: - The first line contains an integer n (1 <= n <= 10^5), the number of elements in the array. - The second line contains n space-separated integers, the elements of the array. These integers can be both positive and negative. Output: - Print a single integer: the length of the longest subarray with a sum of zero. Example: Input: 8 1 2 -2 4 -4 1 1 -1 Output: 6