title: Algorithm for TripleSum Calculation O(n) time, Java
body: <p>The task at hand is to come up with an algorithm that takes in an array of non-negative integers, and returns a boolean value depending on whether the array contains 3 numbers which add up to 225.</p>
  
  <p>The hard part is to write this is O(n) time.</p>
  
  <p>Anyone have any ideas?</p>