about | help | code help+videos | done | prefs |
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) |
Progress graphs:
Your progress graph for this problem
Random user progress graph for this problem
Random Epic Progress Graph
Difficulty: 290
Copyright Nick Parlante 2017 - privacy