Partition a set into two subsets of equal sum

Given a list of numbers, check if it can be partitioned into two parts such that the sum of elements in both parts is the same.

Hint

Consider if there is sublists that is half of the total. Iterate through each element in the list. For each element, explore two possibilities:

• Include the element: Subtract the element's value from the target_sum, and recursively check if a subset can be found for the reduced target_sum using the remaining elements in the list.
• Exclude the element: Recursively check if a subset can be found for the original target_sum using the remaining elements in the list.

If the target_sum reaches 0, it means a sublist with the desired sum has been found. Return true.

• Python
• Javascript
•  Run

def check(ls, target):
  if target == 0:
    return True

  if ls[0] > target:
    return False

  return check(ls[1:], target - ls[0]) or check(ls[1:], target)

ls = [1, 5, 11, 5]

print(False if sum(ls) % 2 != 0 else check(ls, sum(ls) // 2))

function check(list, target) {
  if (target === 0) {
    return true;
  } 

  if (list[0] > target) {
    return false;
  }

  return check(list.slice(1), target - list[0]) || check(list.slice(1), target);
}

const list = [1, 5, 11, 5];
const sum = list.reduce((c, i) => c + i, 0);

console.log((sum % 2 != 0) ? false : check(list, sum / 2));