If the last vowel in the subsequence until now is same as the vowel at current index , add it to the subsequence
else if ( mapping [ subList [ subList . size ( ) - 1 ] ] == mapping [ str [ index ] ] ) return longestSubsequence ( str , subList + str [ index ] , index + 1 ) ;