How do I solve this? Either through recursion? Or possibly through the replace() method? Any help/ideas would be great : Look for patterns like "tip" and "top" in the string -- length-3, starting with 't' and ending with 'p'. Return a string where for all such words, the middle letter is gone, so "tipXtap" yields "tpXtp".