#k-sum

One type of problem that consistently stumps me when solving LeetCode questions has to do with finding unique sub-arrays of a longer array and then checking something about those sub-arrays. Let’s break down the concept of finding the number of combinations that sum up to a target, also known as the k-sum problem. To find all unique subarrays of length k within an array, where the subarrays are…