Subarray sum equals k

Question

Subarray sum equals k Given an integer array arr and a target value k, write a function to find and return the maximum length of a subarray that sums to k. If there is no such subarray return 0. Example 1 > - **Input:** arr = [4, 4, 2, 6, 4], k = 10 > - **Output:** 3 > - **Explanation:** The subarray [4, 4, 2] has a maximum length of 3 and a sum of 10. Example 2 > - **Input:** arr = [2, 2, 1, 2, 4, 3], target = 7 > - **Output:** 4 > - **Explanation:** The subarray [2, 2, 1, 2] has a maximum length of 4 and a sum of 7. Example 3 > - **Input:** arr = [2, 3, 1, 2, 4, 3], target = 100 > - **Output:** 0 > - **Explanation:** There is no subarray whose sum is equal to 100.

Accepted Answer

Optimal Solution: Time Complexity O(N), Space Complexity O(1). Codeintuition provides an interactive coding environment for this problem.