| about | help | code help+videos | done | prefs | 
norm.krumpe@muohio.edu program12
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    
firstLast6 H     
commonEnd    
max2    
sum2    
makePi 
numSequence    
emptyArray    
makeEnds    
middleWay    
swapEnds    
fix23  
frontPiece    
makeMiddle    
insertSum    
unlucky1    
rotateLeft3    
no23 
Part 2: Solve these array problem which will give you practice with some standard array algorithms. Use "for each" style loops whenever possible.
sum    
max    
countEvens    
contains    
indexOf   
countRaises 
isAbsent  
evenIndexes  
reverseArray  
hasSymmetry  
only14  
no14   
removeDuplicates 
Part 3: Solve these array problems that involve a variety of problem-solving strategies.
fill    
sumArrays    
secondMax    
bumpTheNines    
allButLast    
onlyEvens 
Copyright Nick Parlante 2017 - privacy