Given an unsorted array of integers (e.g [1, -2, 4, 100]), write a method that checks if there is a triplet that sums to 0. You may use a number more than once. (e.g [-2, 1, 1] exists in said array and sums to 0, so true should be returned).