CodingBat highSum

highSum

Given two arrays with at least one element in each, return the sum of the sum of the digits of the array whose digit sum is the highest and -1 if they are equal.

highSum([1, 34], [12, 5]) → -1
highSum([1, 2, 3, 4, 5], [12345]) → -1
highSum([32, 52, 42], [2, 22, 67]) → 10

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

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

Java Example Solution Code
Java String Introduction (video)
Java Substring v2 (video)
Java String Equals and Loops
Java String indexOf and Parsing
Java If and Boolean Logic
If Boolean Logic Example Solution Code 1 (video)
If Boolean Logic Example Solution Code 2 (video)
Java For and While Loops
Java Arrays and Loops
Java Map Introduction
Java Map WordCount
Java Functional Mapping
Java Functional Filtering

Misc Code Practice

Code Badges
Introduction to Mod (video)
MakeBricks problem and solution (video x 2)
FizzBuzz the famous code interview question (video)

Difficulty: 350 Post-solution available

id/email
password

forgot password \| create account