Challenge: Splitting the Pirate Loot

Problem

---

3-Partition Problem

Partition a set of integers into three subsets with equal sums.

Input: A sequence of integers $v_{1}$, $v_{2}$,…, $v_{n}$.

Output: Check whether it is possible to partition them into three subsets with equal sums, i.e., check whether there exist three disjoint sets $S_{1}$, $S_{2}$, $S_{3}$ ⊆ {$1,2,...,n$ ...