CodeWorkouts X161 - X177

Given an array of ints, compute recursively the number of times that the value 11 appears in the array (no loops). We'll use the...

Given a string, compute recursively a new string where all the adjacent chars are now separated by a "*". So given "hello", return...

Given a string that contains a single pair of parenthesis, compute recursively a new string containing only the parentheses and their...

Given a string and a non-empty substring sub, compute recursively if at least n copies of sub appear in the string somewhere, possibly...

Given a string str and a non-empty substring sub, compute recursively the largest substring which both starts and ends with sub and...

Given a string, return true if it is a nesting of zero or more pairs of parentheses, like "(())" or "((()))". Suggestion: check the first...

Given a string, compute the number of times lowercase "hi" appears in the string. Make the countHi be recursive.

Count recursively (no loops) the total number of "abc" and "aba" substrings that appear in the given string.

Given a string, compute recursively (no loops) a new string where all the lowercase 'x' chars have been changed to 'y' chars.

Given base and n that are both 1 or more, compute recursively (no loops) the value of base to the n power, so powerN(3, 2) is 9 (3...

We'll say that a "pair" in a string is two instances of the same character separated by another character. So in "AxA", the A's make a...

Given a string, return a recursively "cleaned" string where adjacent chars that are the same have been reduced to a single char. So...

Given an array of ints, compute recursively if the array contains somewhere a value followed immediately by that same value times 10....

Given a string, compute recursively a new string where all the 'x' chars have been removed.

Given an array of ints, compute recursively if the array contains a 6. We'll use the convention of considering only the part of the array...

Given a non-negative int n, return the count of the occurrences of 7 as a digit, so for example 717 yields 2. (no loops). Note that mod (...

Given a string, compute recursively (no loops) a new string where all appearances of "pi" have been replaced by "3.14".