CodingBat code practiceorion.a.smith@gmail.com apcsa-strings
Description:AP CS A Strings (Unit 2)
String problems (AP Computer Science A)
These problems relate to String operations from Unit 2, Using Objects.
Creating consistent CodingBat solution code
Remember the structure of a CodingBat solution, to keep you from skipping important information. See the apcsa-primitives problem set for the desired solution structure.
This page of String problems is to supplement the ones provided by CodingBat. See the excellent String-1, String-2 and String-3 stock problems for a lot more practice. I wrote my problem set to give a more structured sequence of introductory-level problems to solve.
Very useful introduction! Once you get to a problem in this series, scroll to the bottom of the page and you will see several links to great tutorials about Strings right here on the CodingBat site.
String problems, no loops
These problems will just test your basic knowledge of String methods: equals, length, indexOf and substring. Remember that indexOf and substring each have versions with one and two parameters, which modify the way they work!
apcsaStringsReturnString
apcsaStringsReturnLength H
apcsaStringsSameLength H
apcsaStringsAreEqual H
apcsaStringsFirstOccurrence H
apcsaStringsOccurrenceAfter
apcsaStringsGimmeFirstFive H
apcsaStringsGimmeMaybeFirstFive
apcsaStringsBabyTalk
apcsaStringsGimmeFifth
apcsaStringsGimmeFifth2
apcsaStringsGimmeSingle
apcsaStringsGimmeLastFive
apcsaStringsGimmeLastN
apcsaStringsGimmeDoubled
apcsaStringsFirstWordOccursLater
apcsaStringsFirstFiveEqual
apcsaStringsFirstFiveSearch
apcsaStringsGimmeLastThreeReversed
String problems, with loops
These problems add in the idea of looping over the characters in a String, which is necessary to solve many more advanced challenges. You will need to combine loops with substrings using index positions to do well on these problems.
apcsaStringsGimmeEvens
apcsaStringsGimmeOdds
apcsaStringsGimmeNs
Authoring docs
Copyright Nick Parlante 2017 - privacy