censorLetter which takes a string and a char to censor as parameters and returns a “censored” string where all copies of the char are replaced with *. For example, `censorLetter("Bye world", ’o’)` returns the string “Bye w*rld”.
ispalindrome which takes a string named input and returns a bool. We will do so by using two indexes. One that starts at 0 and counts up. The other will start at the end of the string and count down. The function returns true if the string is a palindrome and false if not. The code is mixed up and contains extra blocks. Put the necessary blocks in the correct order.
.size() to figure out the length of the string. You can use that to figure out the middle and end position.
bool caturdayCheck(string word) function. It should return true if the word has "cat" starting at either the first or second character of the word. Otherwise, return false.
Input: catch Output: true Input: scatter Output: true Input: concatenate Output: false
string wordShortener(string startWord) function. If the startWord is 4 characters or less, return it. If it is more than 4 characters, return a new string that has the first two characters of the word followed by the last two characters.
Input: cs Output: cs Input: programming Output: prng
substr is useful for getting the two chunks. If the string has length n, what index is the next to last character at?
boldContents. It takes a string that contains [b]???[/b] where ??? can be any text. It should return a string containing just the ??? part.
Input: [b]This is some text[/b] Output: This is some text Input: Hello [b]class[/b]. Output: class
.find() to locate the start and end. You will need to do math to figure out how many characters are between them.
string initials(string name) function that takes a name like Sergio Romas Garcia or Jane Goodall and returns the initials for that name (SRG or JG). You should use spaces to identify name parts. You can assume there are always either one or two spaces.
string::npos to check if the second space actually exists. You will need one set of logic for if there is one spaces and a different set if there are two spaces.
int countQuotes(string s). It should count how many quotation marks (either " or ') there are in the string and return the total.
Hello "world" 'this' is "a" test it should return 6 because there are six quotation marks in that string (three double quotes and three single quotes). Similarly, if given the input It's a "small" world it should return 3 (one single quote and two double quotes).
string leetspeak(string s). It should take the input string, and replace all the e characters with 3, all the o’s with 0, all of the t’s with 7, and all the l’s’ with 1. Then return the modified version of the string. For example:
Input: hello world Output: h3110 w0r1d
string stringCompactor(string s). It should take the input string and create a “compacted” version where only ever other character is kept (1st, 3rd, 5th,...). For example:
Input: hello Output: hlo Input: This is a test Output: Ti sats
erase to delete the characters you do not want from the original string.
