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

AP-1 > scoresSpecial
prev  |  next  |  chance

 Given two arrays, A and B, of non-negative int scores. A "special" score is one which is a multiple of 10, such as 40 or 90. Return the sum of largest special score in A and the largest special score in B. To practice decomposition, write a separate helper method which finds the largest special score in an array. Write your helper method after your scoresSpecial() method in the JavaBat text area.scoresSpecial([12, 10, 4], [2, 20, 30]) → 40scoresSpecial([20, 10, 4], [2, 20, 10]) → 40scoresSpecial([12, 11, 4], [2, 20, 31]) → 20...Save, Compile, Run (ctrl-enter)public int scoresSpecial(int[] a, int[] b) { } Editor font size %:75100125150Shorter 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

### Misc Code Practice

Difficulty: 245.0

Copyright Nick Parlante 2017 - privacy