Find the longest subsequence in an array with sum zero.

• Iterate through the array and keep track of the running sum.

• Store the running sum in a hashmap along with the index.

• If the same sum is encountere...read more