Discussion on "LeetCode 560. Subarray Sum Equals K - From Intuitive O(n²) to Optimized O(n) solution using HashMap(Med, Java)"

Anni Huang · 2025-07-17T08:38:07.450Z

Problem Statement LeetCode 560. Subarray Sum Equals K Given an integer array nums and an integer k, return the total number of continuous subarrays whose sum is equal to k. Example: Input: nums = [1,1,1], k = 2 Output: 2 (subarrays [1,1] at indice...

Discussion on "LeetCode 560. Subarray Sum Equals K - From Intuitive O(n²) to Optimized O(n) solution using HashMap(Med, Java)" | Hashnode

Search Hashnode

LeetCode 560. Subarray Sum Equals K - From Intuitive O(n²) to Optimized O(n) solution using HashMap(Med, Java)

Responses