id/email | |

password | |

forgot password | create account | |

Or use |

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

Recursion-2 > splitOdd10

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 one group is a multiple of 10, and the sum of the other group is odd. Every int must be in one group or the other. Write a recursive helper method that takes whatever arguments you like, and make the initial call to your recursive helper from splitOdd10(). (No loops needed.) splitOdd10([5, 5, 5]) → true splitOdd10([5, 5, 6]) → false splitOdd10([5, 5, 6, 1]) → 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
- Java Functional Mapping
- Java Functional Filtering

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

Difficulty: 421.0

Copyright Nick Parlante 2016 - privacy