Do you have to use recursion? I think those directions are a little vague, but it sounds like you're swapping consecutive characters that aren't first or last, so last would become lsat or little would become ltilte. I'd just split the string and read the characters into an array, then iterate through the array with a for or while loop. The string methods are probably to split the string, determine its length and join the jumbled characters into a string.