| about | help | code help+videos | done | prefs | 
norm.krumpe@muohio.edu cse174program8
Each problem is worth 1 point.
NOTE: CodingBat is a bad place to debug. If you want to debug, write your methods in Dr. Java, and use the debugger to debug them. Then, switch back to CodingBat. In Dr. Java, make your methods static, then you can debug by calling your methods from the interactions pane, or from a separate main() method.
Part 1: Solve these array problems which do not require loops
 sum3
sum3     firstLast6 H
firstLast6 H      commonEnd
commonEnd     max2
max2     sum2
sum2     makePi
makePi 
 numSequence
numSequence     emptyArray
emptyArray     makeEnds
makeEnds     middleWay
middleWay     swapEnds
swapEnds 
Part 2: Solve these array problem which will give you practice with some standard array algorithms. Use "for each" style loops whenever possible.
 sum
sum     max
max     countEvens
countEvens     contains
contains     indexOf
indexOf    countRaises
countRaises 
 isAbsent
isAbsent     evenIndexes
evenIndexes     reverseArray
reverseArray     hasSymmetry
hasSymmetry     only14
only14    no14
no14  
 has22
has22     appendToEnd
appendToEnd     padEnds
padEnds     findSubArray
findSubArray     inAbcOrder H
inAbcOrder H     pair10
pair10  
 tenSum
tenSum     pre4
pre4     allButLast
allButLast     allButFirst
allButFirst     isSorted
isSorted    repeat
repeat  
 fill
fill     sumArrays
sumArrays     secondMax
secondMax     bumpTheNines
bumpTheNines     onlyEvens
onlyEvens 
Authoring docs
Copyright Nick Parlante 2017 - privacy