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

 

jebbert@volusia.k12.fl.us > June2_2016_APSL_sumNonLowest
prev  |  next  |  chance

Write a method that returns the sum of all the integers in the array EXCEPT for the lowest-valued integer in the array. That lowest-valued integer could occur multiple times in the array. Any integers are possible in the array, including zero and negative values. Also, the array could be empty. If the array is empty or only has one element, or all of the elements have the same value, return zero.


June2_2016_APSL_sumNonLowest([15, 15, 15, 15, 15]) → 0
June2_2016_APSL_sumNonLowest([83]) → 0
June2_2016_APSL_sumNonLowest([-55]) → 0

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

public int June2_2016_APSL_sumNonLowest(int[] nums) { }

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: 290

Copyright Nick Parlante 2017 - privacy