Largest Subarray with 0 sum

Problem Statement Given an array of integers, find the maximum length of a subarray whose sum is 0. Example Input: arr = [15, -2, 2, -8, 1, 7, 10, 23] Output: 5 Explanation: The longest subarray with sum 0 is: [-2, 2, -8, 1, 7] First Approach (Brute Force) The first idea that comes to mind is: Fix a starting index i Keep adding elements till index j Check if the sum becomes 0 Track the maximum length Code (Java – Brute Force) class Solution { int maxLength ( int arr []) { int maxLen = 0 ; for (