Divide-Conquer
Given two strings A and B with n characters each one, we must find the largest substring of voyels that A and B have in common
Given two strings A and B with n characters each one, we must find the largest substring of voyels that A and B have in common