title: Java Recursion Problem
body: <p>I had a recursion interview question problem in Java,Need your help on this.</p>
  
  <p>Write a <code>**Java function**</code> such that :: Given an array of ints, is it possible to divide the ints into two groups, so that the sum of the two groups is the same, with these constraints: all the values that are multiple of 5 must be in one group, and all the values that are a multiple of 3 (and not a multiple of 5) must be in the other. (No loops needed.) </p>
  
  <p><code>
  split53({1,1}) → true<br>
  split53({1, 1, 1}) → false<br>
  split53({2, 4, 2}) → true
  </code></p>
  
  <p>PS:This was a Interview Question for hewlett packard</p>