### Problem

Given a set of N integers, find all sets of three elements in the array that sum to a given integer S.

### Solution

Solution is of $$O(N^2)$$ time.