Or, "Swap the first and last letters of each word"
Your challenge is to, given a string of alphabetical ASCII characters as well as one other character to use as a delimiter (to separate each word), swap the first and last letters of each word. If there is a one-character word, leave it alone.
The examples/testcases use the lowercase letters and the space as the delimiter.
You do not need to handle punctuation; all of the inputs will only consist of the letters a through z, separated by a delimiter, all of a uniform case.
For example, with the string "hello world":
Input string: "hello world" Identify each word: "[hello] [world]" Identify the first and last letters of each word: "[[h]ell[o]] [[w]orl[d]]" Swap the first letters of each word: "[[o]ell[h]] [[d]orl[w]]" Final string: "oellh dorlw"
NOTE: the delimiter does not need to be inputted separately. The delimiter is just the character used to separate words. It can be anything. I wanted to leave options open for creative golfers, so I did not want to limit it to just spaces or new lines. The delimiter is just a character that separates words in the input string.
"swap the first and last letters of each word" -> "pwas eht tirsf dna tasl setterl fo hace dorw" "hello world" -> "oellh dorlw" "test cases" -> "test sasec" "programming puzzles and code golf" -> "grogramminp suzzlep dna eodc folg" "in a green meadow" -> "ni a nreeg weadom" "yay racecar" -> "yay racecar"