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

 

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

Write a method that returns the largest value of all the "Strange Digit Sums" from 1 to 'topNum'. See the directions for the "Strange Digit Sum" method.


ggg2MaxStrangeDigitSums(1) → 2
ggg2MaxStrangeDigitSums(999) → 138
ggg2MaxStrangeDigitSums(2414) → 1139

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

public int ggg2MaxStrangeDigitSums(int topNum) { }

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