Subset Sum Equal To K Problem Statement

Given an array/list of positive integers and an integer K, determine if there exists a subset whose sum equals K.

Provide true if such a subset exists, otherwise return false.

Example:

Input:

ARR = {1,2,3,4}, K = 4

Output:

true

Explanation:

There exist subsets like {1,3} and {4} where the sum is 4, so the output is true.

Constraints:

• 1 ≤ T ≤ 5
• 1 ≤ N ≤ 10^3
• 0 ≤ ARR[i] ≤ 10^9
• 0 ≤ K ≤ 10^9
• Time Limit: 1 sec