Search Results

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

The number 6 is a truly great number. Given two int values, a and b, return true if either one is 6. Or if their sum or difference is 6....

When squirrels get together for a party, they like to have cigars. A squirrel party is successful when the number of cigars is between 40...

You and your date are trying to get a table at a restaurant. The parameter you is the stylishness of your clothes, in the range 0..10,...

You have a green lottery ticket, with ints a, b, and c on it. If the numbers are all different from each other, the result is 0. If all...

Write a method called listUpper() that takes in a list of strings, and returns a list of the same length containing the same strings but...

Write a method called listSearch() that takes in a target string and a list of other strings. This method returns a (possibly shorter)...

Given a string, consider the prefix string made of the first N chars of the string. Does that prefix string appear somewhere else in the...

Returns true if for every '*' (star) in the string, if there are chars both immediately before and after the star, they are the same.

Given two strings, base and remove, return a version of the base string where all instances of the remove string have been removed (not...

Given a string, return true if the number of appearances of "is" anywhere in the string is equal to the number of appearances of "not"...

We'll say that a "triple" in a string is a char appearing three times in a row. Return the number of triples in the given string. The...

We'll say that a lowercase 'g' in a string is "happy" if there is another 'g' immediately to its left or right. Return true if all the...

Given a string, return the length of the largest "block" in the string. A block is a run of adjacent chars that are the same.

Given a string, look for a mirror image (backwards) string at both the beginning and end of the given string. In other words, zero or...

Given a string, return the sum of the numbers appearing in the string, ignoring all other characters. A number is a series of 1 or more...

Given a string, return a string where every appearance of the lowercase word "is" has been replaced with "is not". The word "is" should...

Write the missing base case for function largest. Function largest should find the largest number in array numbers. When largest is first...

For function multiply, write the missing base case condition and action. This function will multiply two numbers x and y. You can assume...

The greatest common divisor (GCD) for a pair of numbers is the largest positive integer that divides both numbers without remainder. For...

For function log, write the missing base case condition and the recursive call. This function computes the log of n to the base b. As an...

For function sumtok, write the missing recursive call. This function returns the sum of the values from 1 to k.

For function addOdd(n) write the missing recursive call. This function should return the sum of all postive odd numbers less than or...

For function sumOfDigits, write the missing recursive call. This function takes a non-negative integer and returns the sum of its digits....