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

 

tmhscs@gmail.com lists > list_golfingBros
prev  |  next  |  chance

Adam, Ben, and Caleb are brothers who are competitive golfers. They have a small wager on who is the best golfer this month. They have recorded their scores for the month in separate lists. Return the name of the brother who has the lowest average for this month. If a brother has less than two scores, he does not have enough scores to qualify as the best golfer. At least one of the brothers will have enough scores to qualify.


list_golfingBros([70, 75, 80], [80, 82, 85], [90, 91, 92]) → "Adam"
list_golfingBros([100, 75], [80, 82, 85, 86], [90, 91, 92]) → "Ben"
list_golfingBros([70], [80, 82], [90, 91, 92]) → "Ben"

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

public String list_golfingBros(List<Integer> adamScores, List<Integer> benScores, List<Integer> calebScores) { }

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

Post-solution available

Copyright Nick Parlante 2017 - privacy