1. Given an array find a subset that sums to a given sum K 2. Given an array with duplicate elements, print all triplets that sum to K. Each element at any index i can only be used once.

Given an array, find a subset that sums to a given sum K and print all triplets that sum to K.

• Use a recursive approach to find subsets that sum to K

• Use a nested loop to find triplets that sum to K

• Avoi...read more