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

 

tmhscs@gmail.com monroe > compress_numIntegerChanges
prev  |  next  |  chance

Given an integer array containing numerical values, return the number of times that the value changes from the previous to the current value from the first to the last element in the array.


compress_numIntegerChanges([1, 1, 1]) → 1
compress_numIntegerChanges([1, 2, 2]) → 2
compress_numIntegerChanges([1, 2, 3]) → 3

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

public int compress_numIntegerChanges(int[] nums) { }

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