Java question

Exercise 1

Complete the method numXY.

It finds the number of times the string "XY" appears in the input string recursively.

You must not use any loops or regular expressions.

Test cases: numXY("AAXYAA") 1 numXY("AXYBXYAA") 2

Exercise 2

Complete the method remDup.

It reduces all adjacent same characters that appear in the input string to a single character recursively.

You must not use any loops or regular expressions.

Test cases: remDup("hello") "helo" remDup("abbbcd") "abcd"

Exercise 3

Complete the method sepStar.

It separates all identical adjacent characters that appear in the input string from each other by "*" recursively.

You must not use any loops or regular expressions.

Test cases: sepStar("hello") "hel*lo" sepStar("uuvxxyzzz") "u*uvx*xyz*z*z"

Final Exercise

Complete the helper method smallest.

It finds the smallest integer in an integer array recursively.

You may assume that input array has at least one element in it

You must not use any loops or regular expressions.

Test cases: smallest([10, 5, 7, 9]) 5