Reverse the Interior of Vowel-Bounded Words
Problem statement
For this exercise, use the callable contract below.
You are given an array of strings text, where each string represents a word.
A word qualifies when both its first and last characters are vowels. The vowels are a, e, i, o, and u, and the check is case-insensitive.
For every qualifying word, reverse only the substring between its first and last characters. Keep the two endpoint characters unchanged. Leave every other word unchanged and preserve the original array order.
Return the modified array of strings.
Function
reverseVowelBoundedInteriors(text: String[]) → String[]Examples
Example 1
text = ["abcde","acvbn","Etuilo"]return = ["adcbe","acvbn","Eliuto"]abcdebegins withaand ends withe, so reversingbcdproducesadcbe.acvbndoes not end with a vowel and remains unchanged.Etuilobegins and ends with vowels; reversingtuilproducesEliuto.
Constraints
1 <= text.length <= 105- Every element of
textis a non-empty word containing uppercase or lowercase English letters. - The total number of characters across all words is at most
105. - Vowel checks are case-insensitive, while every character's original case is preserved.