id/email | |

password | |

forgot password | create account | |

Or use |

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

Recursion-2 > groupSumClump

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 choose a group of some of the ints, such that the group sums to the given target, with this additional constraint: if there are numbers in the array that are adjacent and the identical value, they must either all be chosen, or none of them chosen. For example, with the array {1, 2, 2, 2, 5, 2}, either all three 2's in the middle must be chosen or not, all as a group. (one loop can be used to find the extent of the identical values). groupSumClump(0, [2, 4, 8], 10) → true groupSumClump(0, [1, 2, 4, 8, 1], 14) → true groupSumClump(0, [2, 4, 4, 8], 14) → false ...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: 415.0

Copyright Nick Parlante 2016 - privacy