Find K-Sum Subsets

Explore how to find all subsets of distinct positive integers that add up to a target sum k. Understand the problem constraints and implement an optimal solution running in O(n * 2^n) time and O(n) space, building a foundation for solving similar subset problems in coding interviews.