CodingBat/Java/Recursion-2/Split53.java at master · pauldpearson/CodingBat

10 lines (8 loc) · 433 Bytes

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.)
split53([1, 1]) → true
split53([1, 1, 1]) → false
split53([2, 4, 2]) → true
public class Split53 {

FilesExpand file tree

Split53.java

Latest commit

History

Split53.java

File metadata and controls