id/email
password
forgot password | create account
about | help | code help+videos | done | prefs
CodingBat code practice

 

sum


Provided an array of integers, ascertain if any combination of the numbers(used at most once) can sum up to goal.


sum([6, 16, 25, 90, 43], 121) → true
sum([9, 20, 11], 1000) → false
sum([5], 17) → false

...Save, Compile, Run (ctrl-enter)

public boolean sum(int[] ary, int goal){ }

Editor font size %:
Shorter output


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 Help

Misc Code Practice

Difficulty: 400 Post-solution available

Copyright Nick Parlante 2017 - privacy