Two Sum problem variations

TwoSumBruteForce.java

private boolean sumsToTarget(int[] arr, int k) {
   for (int i = 0; i < arr.length; i++) {
      for (int j = i + 1; j < arr.length; j++) {
          if (arr[i] + arr[j] == k) {
             return true;
          }
      }
   }
   return false;
}