id/email | |

password | |

forgot password | create account | |

Or use |

about | help | code help+videos | done | prefs |

Recursion-2 > split53

prev | next | chance

Forget It! -- delete my code for this problem### Java Help

### Misc Code Practice

prev | next | chance

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 ...Save, Compile, Run |

Forget It! -- delete my code for this problem

Progress graphs:

Your progress graph for this problem

Random user progress graph for this problem

Random Epic Progress Graph

- Java Example Solution Code
- Java String Introduction (video)
- Java Substring v2 (video)
- Java String Equals and Loops
- Java String indexOf and Parsing
- Java If and Boolean Logic
- If Boolean Logic Example Solution Code 1 (video)
- If Boolean Logic Example Solution Code 2 (video)
- Java For and While Loops
- Java Arrays and Loops
- Java Map Introduction
- Java Map WordCount

- Code Badges
- Introduction to Mod (video)
- MakeBricks problem and solution (video x 2)
- FizzBuzz the famous code interview question (video)

Difficulty: 424.0

Copyright Nick Parlante 2016 - privacy