Find the longest subarray with sum k in an array.

• Use a hashmap to store the prefix sum and its index.

• Iterate through the array and check if the current prefix sum - k exists in the hashmap.

• If it exist...read more