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: Output: The longest subarray with sum 0 is: 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