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

AP-1 > sumHeights2
prev  |  next  |  chance

 (A variation on the sumHeights problem.) We have an array of heights, representing the altitude along a walking trail. Given start/end indexes into the array, return the sum of the changes for a walk beginning at the start index and ending at the end index, however increases in height count double. For example, with the heights {5, 3, 6, 7, 2} and start=2, end=4 yields a sum of 1*2 + 5 = 7. The start end end index will both be valid indexes into the array with start <= end.sumHeights2([5, 3, 6, 7, 2], 2, 4) → 7sumHeights2([5, 3, 6, 7, 2], 0, 1) → 2sumHeights2([5, 3, 6, 7, 2], 0, 4) → 15...Save, Compile, Run (ctrl-enter)public int sumHeights2(int[] heights, int start, int end) { } 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: 246.1

Copyright Nick Parlante 2017 - privacy