Search Results

Given a string, does "xyz" appear in the middle of the string? To define middle, we'll say that the number of chars to the left and right...

Return true if the string "cat" and "dog" appear the same number of times in the given string.

Return true if the given string contains a "bob" string, but where the middle 'o' character can be any character.

Given a string, count the number of words ending in 'y' or 'z'--so the 'y' in "heavy" and the 'z' in "fez" count, but not the 'y' in...

We have bunnies standing in a line, numbered 1, 2, ... The odd bunnies (1, 3, 5, ...) have the normal 2 ears. The even bunnies (2, 4,...

Given a non-negative int n, return the sum of its digits recursively (no loops). Note that mod (%) by 10 yields the rightmost digit (126...

Given a non-negative int n, compute recursively (no loops) the count of the occurrences of 8 as a digit, except that an 8 with another 8...

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 recursively (no loops) the number of times lowercase "hi" appears in the string.

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".

Given a day of the week encoded as 0 = Sun, 1 = Mon, 2 = Tue, ... 6 = Sat, and a boolean indicating if we are on vacation, return a...