| about | help | code help+videos | done | prefs |
Write a method that accepts a positive integer in base 10. The method considers how to write that number in bases 2, 3, 4, 5, 6, 7, 8, 9, and 10. In each case, it is possible to find the sum of the digits in each of those bases. Return the GREATEST sum of the digits found in any of those bases. quizSLAPHL_Q100(89) → 17 quizSLAPHL_Q100(11111) → 23 quizSLAPHL_Q100(94299) → 33 ...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: 299
Copyright Nick Parlante 2017 - privacy