143 Final Practice Questions

3. Collections Mystery

Name
Collections Mystery
Collections Mystery
Collections Mystery
Collections Mystery
Collections Mystery
Collections Mystery
Collections Mystery
Collections Mystery
Collections Mystery
Collections Mystery
Collections Mystery
Collection Mystery

4. Collections Programming (Easier)

Name
retainEqual
cancelCourse
duplicateValues
equals
extractEqual
removeEvenLength
convert
removeDuplicates
acronymFor
retainEvenLength
retainAll

5. Binary Trees (Easier)

Name
isFull
inorderList
purebredOdds
numEmpty
toString
equals
oddDepthSum
hasPathSum
printLeaves
evenBranches
countMultiples
nodesAtLevels
hasPath
oddPathSum
alternateParity
sameStructure
Binary Trees
pairsOfTwins
leavesAtDepthN

6. Collections Programming (Harder)

Name
convert
rarestAge
commonFirstLetters
byAge
pointCount
indexMap
split
sumStrings
whereinTheWorld
recordGrade
convertNames
recordScore
smallestSection
birthdayMonths
byMonth
studentGrades
recordDate
acronyms
Collections Programming
exactShorterThan
recordMoves
Collections
printOverspent

7. Comparable Programming

Name
FoodData
Dieter
Complex
Location
MapLocation
BookData
USCurrency
Rectangle
ItemOrder
TeamData
TimeSpan
RadioStation
Movie
AdmissionEntry
PokemonTrainer
Donation
RentalCar
Beverage
ClockTime
MovieRating
GasPoweredCar

8. Binary Trees (Harder)

Name
limitPathSum
construct
countNodes
tighten
mirror
makeFull
limitLeaves
removeLeaves
construct
combineWith
stretch
removeLeftLeaves
add
completeToLevel
matches
trim
removeRightLeaves
SwapChildrenAtLevel
evenLevels
removeMatchingLeaves
expand
doubleIt
removeSmallLeaves
cloneLonelyChildren
Branching Out...

9. Linked Lists

Name
mergeFrom
compress
removeEvens
interleave
reverse3
reorder3
bubble
switchPairs
shift
reorder
markMultiples
compressDuplicates
rearrange
doubleList
takeSmallerFrom
removeFrom
expand
trimEnds
reOrder
padMultiplesOf
removeAllNegatives
rotate3
sortPairs
stutterTwo
removeRange
weave
removeEvens
surroundWith
removeDuplicates
insertMultiplesOfN