Java: Partition Problem

Difficulty Level: MEDIUM

Problem Statement:

The partition problem is to determine whether a given set can be partitioned into two subsets such that the sum of elements in both subsets is the same.

Input:

arr[] = {1, 5, 11, 5}

Output:

true
The array can be partitioned as {1, 5, 5} and {11}