Leetcode Problem 325. Maximum Size Subarray Sum Equals k

325. Maximum Size Subarray Sum Equals k

Leetcode Solutions

Initialize prefixSum to 0 and longestSubarray to 0.
Initialize a hash map indices with the key-value pair {0: -1} to handle the case when a subarray starting from index 0 sums to k.
Iterate through the array nums using an index i. a. Add nums[i] to prefixSum. b. If prefixSum == k, update longestSubarray to i + 1. c. If prefixSum - k is in indices, update longestSubarray to the maximum of its current value and i - indices[prefixSum - k]. d. If prefixSum is not in indices, add prefixSum to indices with the value i.
Return longestSubarray.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen